Universally-Composable Two-Party Computation in Two Rounds

DOI10.1007/978-3-540-74143-5_7MaRDI QIDQ3612546zbMATH OpenOpenAlexFDO

Authors Omer Horvitz, Jonathan Katz

Publication date 10 March 2009

Published in Advances in Cryptology - CRYPTO 2007 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-74143-5_7

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Advances in Cryptology – CRYPTO 2004
• scientific article; zbMATH DE number 1942420
• On statistical security in two-party computation
• scientific article; zbMATH DE number 2009949
• On secure two-party computation in three rounds

Cited in

(15)

• Black-box reusable NISC with random oracles
• Combinatorially homomorphic encryption
• Secure two-party computation with low communication
• Structure-preserving smooth projective hashing
• Equivocal Blind Signatures and Adaptive UC-Security
• Security of blind signatures revisited
• Non-interactive secure 2PC in the offline/online and batch settings
• Almost optimal oblivious transfer from QA-NIZK
• On the Composition of Two-Prover Commitments, and Applications to Multi-round Relativistic Commitments
• Abuse resistant law enforcement access systems
• Efficient, adaptively secure, and composable oblivious transfer with a single, global CRS
• Towards accountability in CRS generation
• Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation
• Generic construction of UC-secure oblivious transfer
• Adaptive oblivious transfer and generalization

This page was built for publication: Universally-Composable Two-Party Computation in Two Rounds

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