HELP: everlasting privacy through server-aided randomness

DOI10.62056/A3W7TR-10KMaRDI QIDQ7326416zbMATH OpenFDO

Authors Yevgeniy Dodis, Jiaxin Guan, Peter Hall, Alison Lin

Publication date 9 September 2026

Published in Unnamed Author (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.62056/A3W7TR-10K

Mathematics Subject Classification ID

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

Cites work

• A direct key recovery attack on SIDH
• A universal statistical test for random bit generators
• Advances in Cryptology - EUROCRYPT 2004
• An efficient key recovery attack on SIDH
• Codes for Interactive Authentication
• Communication Theory of Secrecy Systems*
• Disappearing cryptography in the bounded storage model
• Everlasting security in the bounded storage model
• Exposure-resilient functions and all-or-nothing transforms
• Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
• Getting the Best Out of Existing Hash Functions; or What if We Are Stuck with SHA?
• scientific article; zbMATH DE number 4195165 (Why is no real title available?)
• scientific article; zbMATH DE number 1256737 (Why is no real title available?)
• scientific article; zbMATH DE number 1024061 (Why is no real title available?)
• scientific article; zbMATH DE number 2086371 (Why is no real title available?)
• scientific article; zbMATH DE number 1842484 (Why is no real title available?)
• scientific article; zbMATH DE number 7706045 (Why is no real title available?)
• Incompressible cryptography
• Long-term security and universal composability
• Multi-instance randomness extraction and security against bounded-storage mass surveillance
• On bounded storage key agreement and one-way functions
• On Everlasting Security in the Hybrid Bounded Storage Model
• On Forward-Secure Storage
• Perfectly secure message transmission
• Polynomial Codes Over Certain Finite Fields
• Quantum cryptography: public key distribution and coin tossing
• Randomness is linear in space
• Robust quantum public-key encryption with applications to quantum key distribution
• SECURITY OF QUANTUM KEY DISTRIBUTION
• Shannon impossibility, revisited
• Speak much, remember little: cryptography in the bounded storage model, revisited
• Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies
• Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies
• Universally composable security: a new paradigm for cryptographic protocols
• Using quantum key distribution for cryptographic purposes: a survey

This page was built for publication: HELP: everlasting privacy through server-aided randomness

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