Secure multiparty computation in the bounded storage model

DOI10.1007/978-3-030-92641-0_14zbMath1490.68070OpenAlexW3203243761MaRDI QIDQ2149802

Satyanarayana Vusirikala, Jiahui Liu

Publication date: 29 June 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-92641-0_14

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Quantum cryptography (quantum-theoretic aspects) (81P94) Computer security (68M25)

Related Items

Speak much, remember little: cryptography in the bounded storage model, revisited

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Non-interactive timestamping in the bounded-storage model
• Conditionally-perfect secrecy and a provably-secure randomized cipher
• Simple schemes in the bounded storage model
• Bit Commitment in the Bounded Storage Model: Tight Bound and Simple Optimal Construction
• Tight security proofs for the bounded-storage model
• On Everlasting Security in the Hybrid Bounded Storage Model
• Founding Cryptography on Oblivious Transfer – Efficiently
• Fast Learning Requires Good Memory
• Everlasting security in the bounded storage model
• Commitment and Oblivious Transfer in the Bounded Storage Model With Errors
• Time-space hardness of learning sparse parities
• Advances in Cryptology - EUROCRYPT 2004