Information-theoretically secure protocols and security under composition
From MaRDI portal
Publication:2931375
DOI10.1145/1132516.1132532zbMath1301.94119OpenAlexW2156867996MaRDI QIDQ2931375
Eyal Kushilevitz, Tal Rabin, Yehuda Lindell
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
Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (15)
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 ⋮ 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 ⋮ Impossibility results for universal composability in public-key models and with fixed inputs ⋮ Perennial secure multi-party computation of universal Turing machine ⋮ Secure computation without computers ⋮ On expected constant-round protocols for Byzantine agreement ⋮ Adaptively Secure Two-Party Computation with Erasures ⋮ Probabilistic Termination and Composability of Cryptographic Protocols ⋮ Probabilistic termination and composability of cryptographic protocols ⋮ Truly Efficient String Oblivious Transfer Using Resettable Tamper-Proof Tokens
This page was built for publication: Information-theoretically secure protocols and security under composition
