Information-theoretically secure protocols and security under composition

DOI10.1145/1132516.1132532MaRDI QIDQ2931375zbMATHOpenAlexFDO

Authors Eyal Kushilevitz, Yehuda Lindell, Tal Rabin

Publication date 25 November 2014

Published in Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.215.5419

zbMATH Keywords

cryptographyinformation-theoretic securitysecure computationprotocol composition

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Information-theoretically secure protocols and security under composition
• Theory of Cryptography
• General composition and universal composability in secure multiparty computation
• Secure composition of cryptographic protocols. (Abstract)
• Security and composition of multiparty cryptographic protocols

Cited in

(25)

• Asymptotically free broadcast in constant expected time via packed VSS
• On the communication efficiency of statistically secure asynchronous MPC with optimal resilience
• Information-Theoretic Security of Cryptographic Channels
• Adaptively Secure Two-Party Computation with Erasures
• Mosaics of combinatorial designs for information-theoretic security
• On expected constant-round protocols for Byzantine agreement
• Secure composition of cryptographic protocols. (Abstract)
• Probabilistic Termination and Composability of Cryptographic Protocols
• Information-theoretically secure protocols and security under composition
• scientific article; zbMATH DE number 5225572 (Why is no real title available?)
• Probabilistic termination and composability of cryptographic protocols
• Perfect (parallel) broadcast in constant expected rounds via statistical VSS
• Detect, pack and batch: perfectly-secure MPC with linear communication and constant expected time
• scientific article; zbMATH DE number 1418286 (Why is no real title available?)
• Secure computation without computers
• Random sources in private computation
• MPC with synchronous security and asynchronous responsiveness
• Perennial secure multi-party computation of universal Turing machine
• On the Necessity of Rewinding in Secure Multiparty Computation
• Impossibility results for universal composability in public-key models and with fixed inputs
• Local Sequentiality Does Not Help for Concurrent Composition
• Adaptive security of multi-party protocols, revisited
• Zero-knowledge IOPs approaching witness length
• Truly efficient string oblivious transfer using resettable tamper-proof tokens
• CRAFT: \underline{C}omposable \underline{R}andomness beacons and output-independent \underline{A}bort MPC \underline{F}rom \underline{T}ime

This page was built for publication: Information-theoretically secure protocols and security under composition

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