Forward secret encrypted RAM: lower bounds and applications

DOI10.1007/978-3-030-90456-2_3OpenAlexW3212420735MaRDI QIDQ2697886

Yevgeniy Dodis, Alexander Bienstock, Kevin Yeo

Publication date: 13 April 2023

Full work available at URL: https://doi.org/10.1007/978-3-030-90456-2_3

zbMATH Keywords

cryptographic data structuresforward secret encrypted RAMs

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (2)

Multicast key agreement, revisited ⋮ On the worst-case inefficiency of CGKA

Uses Software

• Iolus

Cites Work

• Unnamed Item
• Yes, there is an oblivious RAM lower bound!
• Lower bounds for multi-server oblivious RAMs
• Lower bounds for encrypted multi-maps and searchable encryption in the leakage cell probe model
• OptORAMa: optimal oblivious RAM
• On the price of concurrency in group ratcheting protocols
• Stronger lower bounds for online ORAM
• Lower bounds for differentially private RAMs
• Is There an Oblivious RAM Lower Bound?
• Privacy-Preserving Access of Outsourced Data via Oblivious RAM Simulation
• Oblivious RAM Revisited
• How Efficient Can Memory Checking Be?
• Should Tables Be Sorted?
• Software protection and simulation on oblivious RAMs
• Public-Key Puncturable Encryption: Modular and Compact Constructions
• Lower Bounds for Oblivious Data Structures
• 0-RTT Key Exchange with Full Forward Secrecy
• Advances in Cryptology - EUROCRYPT 2004
• Watermarking cryptographic capabilities
• Chosen-Ciphertext Secure Fully Homomorphic Encryption
• Bloom filter encryption and applications to efficient forward-secret 0-RTT key exchange
• Session resumption protocols and efficient forward security for TLS 1.3 0-RTT

This page was built for publication: Forward secret encrypted RAM: lower bounds and applications