Secure Computation Without Authentication
From MaRDI portal
Publication:5451036
DOI10.1007/11535218_22zbMath1145.94457OpenAlexW2130513648MaRDI QIDQ5451036
Tal Rabin, Boaz Barak, Ran Canetti, Rafael Pass, Yehuda Lindell
Publication date: 17 March 2008
Published in: Advances in Cryptology – CRYPTO 2005 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11535218_22
Related Items (17)
UC-secure and Contributory Password-Authenticated Group Key Exchange ⋮ Interactive non-malleable codes ⋮ Transparent batchable time-lock puzzles and applications to Byzantine consensus ⋮ Structure-Preserving Smooth Projective Hashing ⋮ Almost-everywhere secure computation with edge corruptions ⋮ Crowd verifiable zero-knowledge and end-to-end verifiable multiparty computation ⋮ Impossibility results for universal composability in public-key models and with fixed inputs ⋮ Player-Centric Byzantine Agreement ⋮ Efficient UC-Secure Authenticated Key-Exchange for Algebraic Languages ⋮ Efficient algorithms for anonymous Byzantine agreement ⋮ Removing Erasures with Explainable Hash Proof Systems ⋮ Collusion-Free Protocols in the Mediated Model ⋮ GNUC: a new universal composability framework ⋮ Contributory Password-Authenticated Group Key Exchange with Join Capability ⋮ Password-Authenticated Group Key Agreement with Adaptive Security and Contributiveness ⋮ Analysis of the Blockchain Protocol in Asynchronous Networks ⋮ Efficient constructions for almost-everywhere secure computation
This page was built for publication: Secure Computation Without Authentication
