Theory of Public Key Cryptography

• Security Proofs in ``Ideal'' Models
  • Algorithms for black box fields and their application to cryptography (Boneh, Lipton, Crypto '96)
  • @Random Oracle Model
  • Generic model and Public Key Cryptography []
    • Lower Bounds for Discrete Logarithms and Related Problems (Victor Shoup, 1997)
    • Security of Discrete Log Cryptosystems in the Random Oracle and Generic Model (Jakobsson, Schnorr, 1999)
• Security Notions []
  • Non-malleability []
    • Non-Malleable Cryptography (Danny Dolev, Cynthia Dwork, Moni Naor, 1998)
    • Relations among notions of security for public-key encryption schemes (Bellare, Desai, Pointcheval, Rogaway, Crypto '98)
    • Non-Malleable Encryption: Equivalence between Two Notions, and an Indistinguishability-Based Characterization (Mihir Bellare, Amit Sahai, Crypto 99)
  • Chosen-Ciphertext Security (IND-CCA) []
    • A chosen text attack on the RSA cryptosystem and some discrete logarithm schemes (Desmedt, Odlyzko, Crypto '85)
    • A Practical Public Key Cryptosystem Provably Secure against Adaptive Chosen Ciphertext Attack (Cramer, Shoup 1998)
    • Why chosen ciphertext security matters (Victor Shoup, 1998)
    • Efficient Public-Key Cryptosystems Provably Secure Against Active Adversaries ( Pascal Paillier, David Pointcheval, 1999)
    • Non-Malleable Non-Interactive Zero Knowledge and Adaptive Chosen-Ciphertext Security (Amit Sahai, FOCS 1999)
    • How to Enhance the Security of Public-Key Encryption at Minimum Cost (Eiichiro FUJISAKI,Tatsuaki OKAMOTO, 2000)
    • Chosen-Ciphertext Security for any One-Way Cryptosystem (David Pointcheval, 2000)
    • Secure Length-saving ElGamal Encryption under the Computational Die-Hellman Assumption (Joonsang Baek, Byoungcheon Lee, and Kwangjo Kim, 2000)
    • A Unified Methodology For Constructing Public-Key Encryption Schemes Secure Against Adaptive Chosen-Ciphertext Attack (Edith Elkind and Amit Sahai, eprint 2002/042)
    • A Variant of the Cramer-Shoup Cryptosystem for Groups with Unknwon Order (Stefan Lucks, eprint 2002/052)
    • A Simpler Construction of CCA2-Secure Public-Key Encryption Under General Assumptions (Yehuda Lindell, Eurocrypt 2003)
    • Improved Efficiency for CCA-Secure Cryptosystems Built Using Identity-Based Encryption (Dan Boneh, Jonathan Katz, EPRINT 2004/261)
    • Towards Plaintext-Aware Public-Key Encryption without Random Oracles (Mihir Bellare, Adriana Palacio, Asiacrypt 2004)
      • [scholar]Shows that Damgaards cryptosystem is IND-CCA1 secure under the KEA1 assumption
    • A note on an encryption scheme of Kurosawa and Desmedt (Rosario Gennaro, Victor Shoup, 2005)
    • Tag-KEM/DEM: A New Framework for Hybrid Encryption (Masayuki Abe, Rosario Gennaro, Kaoru Kurosawa, eprint 2005/027)
    • Direct Chosen Ciphertext Security from Identity-Based Techniques (Xavier Boyen and Qixiang Mei and Brent Waters , eprint 2005/288 (ACM CCS 2005))
  • Plaintext awareness []
    • Optimal asymmetric encryption -- How to encrypt with RSA (M. Bellare and P. Rogaway, Eurocrypt 2004)
    • Relations among notions of security for public-key encryption schemes (Bellare, Desai, Pointcheval, Rogaway, Crypto '98)
    • Plaintext Awareness via Key Registration (Jonathan Herzog, Moses Liskov, Silvio Micali, CRYPTO 2003)
    • Plaintext-Simulatability (Eiichiro Fujisaki, eprint 2004/218)
    • Towards Plaintext-Aware Public-Key Encryption without Random Oracles (Mihir Bellare, Adriana Palacio, eprint 2004/221)
    • Cramer-Shoup is Plaintext-Aware in the Standard Model (Alexander W. Dent, eprint 2005/261)
  • Relations among notions of security for public-key encryption schemes (Bellare, Desai, Pointcheval, Rogaway, Crypto '98)
• Self-reducibility []
• One-way functions []
  • One-way functions and pseudorandom generators (Leonid Levin, 1987)
  • A hard-core predicate for all one-way functions (O Goldreich, LA Levin, 1989)
  • Pseudo-random generation from one-way functions (R Impagliazzo, L Levin, M Luby, 1989)
  • One-way functions are essential for complexity based cryptography Impagliazzo, R. Luby, M, 1989 (22.11.04)
  • One-Way Functions are Necessary and Sufficient for Secure Signatures (John Rompel, 1990)
  • One-way functions are essential for non-trivial zero-knowledge ( R Ostrovsky, A Wigderson, 1993)
  • A pseudorandom generator from any one-way function (J Hastad, R Impagliazzo, LA Levin, M Luby, 1999)
• One-Way Permutations []
  • One-way permutations in NC0 (J Hastad, 1987)
  • Limits on the provable consequences of one-way permutations (R Impagliazzo, S Rudich, 1989)
  • haracterizations of the existence of partial and total one-way permutations (J Rothe, L Hemaspaandra, 1999)
  • Characterizing the existence of one-way permutations (L Hemaspaandra, J Rothe, 2000)
• Trapdoor permutations []
  • Certifying Cryptographic Tools: The Case of Trapdoor Permutations (Mihir Bellare and Moti Yung, 1992)
  • How to sign given any trapdoor permutation M Bellare, S Micali, 1992 (22.11.04)
  • Certifying permutations: Non-interactive zero-knowledge based on any trapdoor permutation M Bellare, M Yung, 1996 (22.11.04)
  • One-Way Trapdoor Permutations Are Sufficient for Non-trivial Single-Server Private Information Retrieval (Eyal Kushilevitz and Rafail Ostrovsky, 1997)
  • A Trapdoor Permutation Equivalent to Factoring (Pascal Paillier, 1999)

  ---

  
  
  Cryptology Pointers by Helger Lipmaa
  Got any suggestions or additional links? Mail to <helger.lipmaa>gmail.com
  NB! If you find any broken links, please be kind and report them to me together with their current location!
  
  (C) Helger Lipmaa 1997-2009.