scientific article; zbMATH DE number 1088242

zbMath1059.94527MaRDI QIDQ4364559

Ueli M. Maurer, Christian Cachin

Publication date: 1997

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

unconditional securitylimited memory capacitypractical provably secure cryptosystem

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (33)

Separating adaptive streaming from oblivious streaming using the bounded storage model ⋮ Fine-grained secure computation ⋮ On the (im)possibility of non-interactive correlation distillation ⋮ Secure multiparty computation in the bounded storage model ⋮ Everlasting UC commitments from fully malicious PUFs ⋮ Incompressible cryptography ⋮ Authentication in the bounded storage model ⋮ Interactive non-malleable codes ⋮ Long-term security and universal composability ⋮ Rate-1 incompressible encryption from standard assumptions ⋮ Speak much, remember little: cryptography in the bounded storage model, revisited ⋮ One-way functions using algorithmic and classical information theories ⋮ Aspects concerning entropy and utility ⋮ Quantum cryptography beyond quantum key distribution ⋮ Unnamed Item ⋮ Long term confidentiality: a survey ⋮ Public-key cryptography based on bounded quantum reference frames ⋮ Using quantum key distribution for cryptographic purposes: a survey ⋮ Memory-sample lower bounds for learning with classical-quantum hybrid memory ⋮ Basing Weak Public-Key Cryptography on Strong One-Way Functions ⋮ Fine-grained cryptography revisited ⋮ Fine-grained non-interactive key-exchange without idealized assumptions ⋮ Non-interactive timestamping in the bounded-storage model ⋮ Tight time-space lower bounds for finding multiple collision pairs and their applications ⋮ Analyzing security protocols using time-bounded task-PIOAs ⋮ Fine-Grained Cryptography ⋮ 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 ⋮ The Symbiosis between Collision and Preimage Resistance ⋮ Big-Key Symmetric Encryption: Resisting Key Exfiltration ⋮ A Single Initialization Server for Multi-party Cryptography ⋮ Resource-restricted cryptography: revisiting MPC bounds in the proof-of-work era ⋮ On the streaming indistinguishability of a random permutation and a random function

This page was built for publication: