Hyper-encryption and everlasting security

DOI10.1007/3-540-45841-7_1MaRDI QIDQ4736825zbMATH OpenFDO

Authors Yan Zong Ding, Michael O. Rabin

Publication date 11 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2285/22850001.htm

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Everlasting security in the bounded storage model
• Hyper-encryption against space-bounded adversaries from on-line strong extractors
• Simple schemes in the bounded storage model
• Encryption against storage-bounded adversaries from on-line strong extractors
• On Everlasting Security in the Hybrid Bounded Storage Model

Cited in

(30)

• Non-interactive timestamping in the bounded-storage model
• Encryption against storage-bounded adversaries from on-line strong extractors
• Separating adaptive streaming from oblivious streaming using the bounded storage model
• Secure multiparty computation in the bounded storage model
• Authentication in the bounded storage model
• On the (im)possibility of non-interactive correlation distillation
• Long term confidentiality: a survey
• Magnifying computing gaps. Establishing encrypted communication over unidirectional channels
• A new spin on quantum cryptography: avoiding trapdoors and embracing public keys
• Bit commitment in the bounded storage model: tight bound and simple optimal construction
• On Everlasting Security in the Hybrid Bounded Storage Model
• The Bare Bounded-Storage Model: The Tight Bound on the Storage Requirement for Key Agreement
• Unconditional security against memory-bounded adversaries.
• Concealment and its applications to authenticated encryption
• Hyper encryption and everlasting secrets. A survey
• Innovative approaches for security of small artefacts
• Everlasting security in the bounded storage model
• How to fool an unbounded adversary with a short key
• Advances in Cryptology - EUROCRYPT 2004
• Coin flipping from a cosmic source: On error correction of truly random bits
• Information Security and Privacy
• On the Impossibility of Strong Encryption Over $\aleph_0$
• Practical Everlasting Privacy
• Honey encryption: security beyond the brute-force bound
• Speak much, remember little: cryptography in the bounded storage model, revisited
• Infeasibility of instance compression and succinct PCPs for NP
• Memory-sample lower bounds for learning with classical-quantum hybrid memory
• That's AmorE: amortized efficiency for pairing delegation
• On bounded storage key agreement and one-way functions
• HELP: everlasting privacy through server-aided randomness

This page was built for publication: Hyper-encryption and everlasting security

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