Secure multiparty computation in the bounded storage model

DOI10.1007/978-3-030-92641-0_14MaRDI QIDQ2149802zbMATH OpenOpenAlexFDO

Authors Jiahui Liu, Satyanarayana Vusirikala

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

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

Recommendations

• Simple schemes in the bounded storage model
• Everlasting security in the bounded storage model
• Black-box constructions of bounded-concurrent secure computation
• Cryptography in the Bounded-Quantum-Storage Model
• Bounded-concurrent secure multi-party computation with a dishonest majority

Cites work

• scientific article; zbMATH DE number 1256737 (Why is no real title available?)
• scientific article; zbMATH DE number 1088242 (Why is no real title available?)
• scientific article; zbMATH DE number 1942425 (Why is no real title available?)
• scientific article; zbMATH DE number 2086371 (Why is no real title available?)
• scientific article; zbMATH DE number 799789 (Why is no real title available?)
• scientific article; zbMATH DE number 1418287 (Why is no real title available?)
• Advances in Cryptology - EUROCRYPT 2004
• Bit commitment in the bounded storage model: tight bound and simple optimal construction
• Commitment and Oblivious Transfer in the Bounded Storage Model With Errors
• Conditionally-perfect secrecy and a provably-secure randomized cipher
• Everlasting security in the bounded storage model
• Fast learning requires good memory: a time-space lower bound for parity learning
• Founding Cryptography on Oblivious Transfer – Efficiently
• Non-interactive timestamping in the bounded-storage model
• On Everlasting Security in the Hybrid Bounded Storage Model
• Simple schemes in the bounded storage model
• Tight security proofs for the bounded-storage model
• Time-space hardness of learning sparse parities

Cited in

(8)

• scientific article; zbMATH DE number 6705022 (Why is no real title available?)
• Speak much, remember little: cryptography in the bounded storage model, revisited
• A Probabilistic Small Model Theorem to Assess Confidentiality of Dispersed Cloud Storage
• Advances in Cryptology - CRYPTO 2003
• Theory of Cryptography
• Secure \(k\)-skyband computation framework in distributed multi-party databases
• Memory-sample lower bounds for learning with classical-quantum hybrid memory
• Disappearing cryptography in the bounded storage model

This page was built for publication: Secure multiparty computation in the bounded storage model

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