Papers

• Background and Proofs with Ideal Primitives
  • [Bellare, Rogaway; Eurocrypt'06] Code-Based Game-Playing Proofs and the Security of Triple Encryption
  • [Shoup; IACR Eprint'04] Sequences of games: a tool for taming complexity in security proofs
  • [Jha, Nandi; IACR Eprint'18] Applications of H-Technique: Revisiting Symmetric Key Security Analysis
  • [Luby, Rackoff; STOC'86 and CRYPTO'86] How to Construct Pseudorandom Permutations from Pseudorandom Functions
  • [Bellare, Krovetz, Rogaway; EUROCRYPT'98] Luby-Rackoff backwards: Increasing security by making block ciphers non-invertible
  • [Even, Mansour; J. Cryptology'97] A Construction of a Cipher from a Single Pseudorandom Permutation
  • [Hoang, Tessaro; CRYPTO'16] Key-alternating Ciphers and Key-length Extension: Exact Bounds and Multi-user Security
  • [Maurer; EUROCRYPT'02] Indistinguishability of Random Systems
  • [Dai, Hoang, Tessaro; CRYPTO'17] Information-theoretic Indistinguishability via the Chi-squared Method
• Time-Space Trade-offs
  • [Fiat, Naor; STOC'86] Rigorous Time/Space Trade-offs for Inverting Functions
  • [Corrigan-Gibbs, Kogan; ECCC'18] The Function-Inversion Problem: Barriers and Opportunities
  • [De, Trevisan, Tulsiana; CRYPTO'10] Non-uniform attacks against one-way functions and PRGs
  • [Dodis, Guo, Katz; EUROCRYPT'17] Fixing Cracks in the Concrete: Random Oracles with Auxiliary Input, Revisited
  • [Coretti, Dodis, Guo, Steinberger; EUROCRYPT'18] Random Oracles and Non-Uniformity
• The Generic Group Model
  • [Shoup; EUROCRYPT'97] Lower Bounds for Discrete Logarithms and Related Problems
  • [Yun; EUROCRYPT'15] Generic Hardness of the Multiple Discrete Logarithm Problem
  • [Coretti, Dodis, Guo; CRYPTO'18] Non-Uniform Bounds in the Random-Permutation, Ideal-Cipher, and Generic-Group Models
  • [Corrigan-Gibbs, Kogan; EUROCRYPT'18] The Discrete-Logarithm Problem with Preprocessing
• Oblivious RAM
  • [Goldreich, Ostrovsky; JACM'96] Software Protection and Simulation on Oblivious RAM
  • [Larsen, Nielsen; CRYPTO'18] Yes, There is an Oblivious RAM Lower Bound!
  • [Weiss, Wichs; TCC'18] Is There an Oblivious RAM Lower Bound for Online Reads?
  • [Asharov et al.; IACR Eprint'18] OptORAMa: Optimal Oblivious RAM
  • [Jafargholi, Larsen, Simkin; IACR Eprint'19] Optimal Oblivious Priority Queues and Offline Oblivious RAM
  • [Patel, Persiano, Raykova, Yeo; FOCS'18] PanORAMa: Oblivious RAM with Logarithmic Overhead
  • [Shi, Chan, Stefanov, Li; ASIACRYPT'11] Oblivious RAM with O((log N)^3) Worst-Case Cost
• Bounded-Retrieval/Storage Model (a.k.a. "Big-Key Crypto")
  • [Bellare, Kane, Rogaway; CRYPTO'16] Big-Key Symmetric Encryption: Resisting Key Exfiltration
  • [Bellare, Dai; ACM CCS'17] Defending Against Key Exfiltration: Efficiency Improvements for Big-Key Cryptography via Large-Alphabet Subkey Prediction
  • [Guan, Zhandry; EUROCRYPT'19] Simple Schemes in the Bounded Storage Model