Cryptography without (Hardly Any) Secrets ?

DOI10.1007/978-3-642-01001-9_21MaRDI QIDQ3627445zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

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

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

Cites work

• Advances in Cryptology - CRYPTO 2003
• scientific article; zbMATH DE number 1418307 (Why is no real title available?)
• On cryptography with auxiliary input
• One-Time Programs
• Simultaneous Hardcore Bits and Cryptography against Memory Attacks
• Theory of Cryptography
• Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems

Cited in

(9)

• All-but-many encryption
• Secrecy without one-way functions
• Securing computation against continuous leakage
• Simultaneous Hardcore Bits and Cryptography against Memory Attacks
• Memory leakage-resilient encryption based on physically unclonable functions
• scientific article; zbMATH DE number 1304335 (Why is no real title available?)
• Cryptography with tamperable and leaky memory
• Advances in Cryptology - CRYPTO 2003
• Theory of Cryptography

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)