Cryptography without (Hardly Any) Secrets ?

DOI10.1007/978-3-642-01001-9_21zbMATH Open1239.94049OpenAlexW1576151945MaRDI QIDQ3627445FDOQ3627445

Authors: Shafi Goldwasser 

Publication date: 12 May 2009

Published in: Advances in Cryptology - EUROCRYPT 2009 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-01001-9_21

Recommendations

• Simultaneous Hardcore Bits and Cryptography against Memory Attacks
• Cryptography with tamperable and leaky memory
• Protecting cryptographic keys against continual leakage
• Public-key cryptosystems resilient to key leakage
• Securing computation against continuous leakage

Mathematics Subject Classification ID

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

Cites Work

• Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
• Simultaneous Hardcore Bits and Cryptography against Memory Attacks
• Title not available (Why is that?)
• On cryptography with auxiliary input
• Theory of Cryptography
• Advances in Cryptology - CRYPTO 2003
• One-Time Programs

Cited In (8)

• Cryptography with tamperable and leaky memory
• All-but-many encryption
• Theory of Cryptography
• Advances in Cryptology - CRYPTO 2003
• Memory leakage-resilient encryption based on physically unclonable functions
• Simultaneous Hardcore Bits and Cryptography against Memory Attacks
• Securing computation against continuous leakage
• Secrecy without one-way functions

This page was built for publication: Cryptography without (Hardly Any) Secrets ?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3627445)