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