A digital signature scheme secure against adaptive chosen-message attacks
SIAM Journal on Computing - Special issue on cryptography
Public-key cryptosystems provably secure against chosen ciphertext attacks
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Foundations of Cryptography: Basic Tools
Foundations of Cryptography: Basic Tools
Pseudorandomness and Cryptographic Applications
Pseudorandomness and Cryptographic Applications
SIAM Journal on Computing
Pseudorandom Functions and Factoring
SIAM Journal on Computing
Keying Hash Functions for Message Authentication
CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
A Provably Secure Additive and Multiplicative Privacy Homomorphism
ISC '02 Proceedings of the 5th International Conference on Information Security
Number-theoretic constructions of efficient pseudo-random functions
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Foundations of Cryptography: Volume 2, Basic Applications
Foundations of Cryptography: Volume 2, Basic Applications
Secure Comparison of Encrypted Data in Wireless Sensor Networks
WIOPT '05 Proceedings of the Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
E.cient Aggregation of encrypted data in Wireless Sensor Networks
MOBIQUITOUS '05 Proceedings of the The Second Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services
Characterization of Security Notions for Probabilistic Private-Key Encryption
Journal of Cryptology
IEEE Transactions on Mobile Computing
Public-key cryptosystems based on composite degree residuosity classes
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Encoding-Free elgamal encryption without random oracles
PKC'06 Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography
A public key cryptosystem and a signature scheme based on discrete logarithms
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
A formal treatment to the privacy of concealed data aggregation (CDA) is given. While there exist a handful of constructions, rigorous security models and analyses for CDA are still lacking. Standard security notions for public key encryption schemes, including semantic security and indistinguishability against chosen ciphertext attacks, are refined to cover the multi-sender nature and aggregation functionality of CDA in the security model. A generic CDA construction based on public key homomorphic encryption is given, along with a proof of its security in the proposed model. The security of two existing schemes is also analyzed in the proposed model.