Information-theoretically secure protocols and security under composition

DOI10.1145/1132516.1132532MaRDI QIDQ2931375zbMATH OpenOpenAlexFDO

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 securityprotocol compositionsecure computation

Mathematics Subject Classification ID

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

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

(32)

• On expected constant-round protocols for Byzantine agreement
• Perennial secure multi-party computation of universal Turing machine
• Mosaics of combinatorial designs for information-theoretic security
• Probabilistic termination and composability of cryptographic protocols
• MPC with synchronous security and asynchronous responsiveness
• Adaptive security of multi-party protocols, revisited
• On the communication efficiency of statistically secure asynchronous MPC with optimal resilience
• Probabilistic Termination and Composability of Cryptographic Protocols
• Information-theoretically secure protocols and security under composition
• Secure composition of cryptographic protocols. (Abstract)
• Truly efficient string oblivious transfer using resettable tamper-proof tokens
• On the Necessity of Rewinding in Secure Multiparty Computation
• Adaptively Secure Two-Party Computation with Erasures
• Local Sequentiality Does Not Help for Concurrent Composition
• Impossibility results for universal composability in public-key models and with fixed inputs
• scientific article; zbMATH DE number 1418286 (Why is no real title available?)
• Secure computation without computers
• scientific article; zbMATH DE number 5225572 (Why is no real title available?)
• Detect, pack and batch: perfectly-secure MPC with linear communication and constant expected time
• CRAFT: \underline{C}omposable \underline{R}andomness beacons and output-independent \underline{A}bort MPC \underline{F}rom \underline{T}ime
• Asymptotically free broadcast in constant expected time via packed VSS
• Random sources in private computation
• Information-Theoretic Security of Cryptographic Channels
• Perfect (parallel) broadcast in constant expected rounds via statistical VSS
• Zero-knowledge IOPs approaching witness length
• Your reputation's safe with me: framing-free distributed zero-knowledge proofs
• Exponent-VRFs and their applications
• Peeking into the future: MPC resilient to super-rushing adversaries
• Asymptotically free broadcast in constant expected time via packed VSS
• Rumors MPC: GOD for dynamic committees, low communication via constant-round chat
• PUFF: maximally \underline{p}roactive sec\underline{u}rity \underline{f}or \underline{f}ree in perfectly secure mpc with guaranteed output delivery
• Secure multi-party linear algebra with perfect correctness

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)