Relations among notions of security for public-key encryption schemes

Universally composable security: a new paradigm for cryptographic protocols

Canetti, R. (2001) · Proceedings 42nd IEEE Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2001.959888 · Cited by 3,309

Guide to Elliptic Curve Cryptography

(2004) · Springer Professional Computing · doi:10.1007/b97644 · Cited by 3,054

Boosting and Differential Privacy

Dwork, C., Rothblum, G. N., & Vadhan, S. (2010) · 2010 IEEE 51st Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2010.12 · Cited by 784

Nonmalleable Cryptography

Dolev, D., Dwork, C., & Naor, M. (2000) · SIAM Journal on Computing · doi:10.1137/s0097539795291562 · Cited by 746

Universally Composable Commitments

Canetti, R., & Fischlin, M. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44647-8_2 · Cited by 621

Cryptographic Hash-Function Basics: Definitions, Implications, and Separations for Preimage Resistance, Second-Preimage Resistance, and Collision Resistance

Rogaway, P., & Shrimpton, T. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-25937-4_24 · Cited by 614

On the Security of Joint Signature and Encryption

An, J. H., Dodis, Y., & Rabin, T. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-46035-7_6 · Cited by 571

Pseudonym Systems

Lysyanskaya, A., Rivest, R. L., Sahai, A., & Wolf, S. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-46513-8_14 · Cited by 521

A Survey of Homomorphic Encryption for Nonspecialists

Fontaine, C., & Galand, F. (2007) · EURASIP Journal on Information Security · doi:10.1155/2007/13801 · Cited by 438

The Order of Encryption and Authentication for Protecting Communications (or: How Secure Is SSL?)

Krawczyk, H. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44647-8_19 · Cited by 393

A Provable-Security Treatment of the Key-Wrap Problem

Rogaway, P., & Shrimpton, T. (2006) · Lecture Notes in Computer Science · doi:10.1007/11761679_23 · Cited by 383

On Cryptographic Assumptions and Challenges

Naor, M. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45146-4_6 · Cited by 360

Lattice Cryptography for the Internet

Peikert, C. (2014) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-11659-4_12 · Cited by 356

A model for asynchronous reactive systems and its application to secure message transmission

Pfitzmann, B., & Waidner, M. (2002) · Proceedings 2001 IEEE Symposium on Security and Privacy. S&P 2001 · doi:10.1109/secpri.2001.924298 · Cited by 349

Squealing Euros: Privacy Protection in RFID-Enabled Banknotes

Juels, A., & Pappu, R. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45126-6_8 · Cited by 347

Public-key cryptography and password protocols

Halevi, S., & Krawczyk, H. (1999) · ACM Transactions on Information and System Security · doi:10.1145/322510.322514 · Cited by 314

OAEP Reconsidered

Shoup, V. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44647-8_15 · Cited by 300

Improved Efficiency for CCA-Secure Cryptosystems Built Using Identity-Based Encryption

Boneh, D., & Katz, J. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30574-3_8 · Cited by 283

Composition and integrity preservation of secure reactive systems

Pfitzmann, B., & Waidner, M. (2000) · Proceedings of the 7th ACM conference on Computer and Communications Security · doi:10.1145/352600.352639 · Cited by 277

Modern Cryptography, Probabilistic Proofs and Pseudorandomness

Goldreich, O. (1999) · Algorithms and Combinatorics · doi:10.1007/978-3-662-12521-2 · Cited by 265

Reaction Attack on Outsourced Computing with Fully Homomorphic Encryption Schemes

Zhang, Z., Plantard, T., & Susilo, W. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-31912-9_28 · Cited by 27