Protocols for bounded-concurrent secure two-party computation in the plain model

DOI10.4086/CJTCS.2006.001zbMATH Open1176.94068OpenAlexW4243021018MaRDI QIDQ3594441FDOQ3594441

Authors: Yehuda Lindell 

Publication date: 8 August 2007

Published in: Chicago Journal of Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: http://cjtcs.cs.uchicago.edu/articles/2006/1/contents.html

Recommendations

• Bounded-concurrent secure two-party computation without setup assumptions
• Bounded-concurrent secure multi-party computation with a dishonest majority
• Theory of Cryptography
• Black-box constructions of bounded-concurrent secure computation
• Lower bounds and impossibility results for concurrent self composition

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62) Network protocols (68M12)

Cited In (7)

• Secure composition of cryptographic protocols. (Abstract)
• Concurrently secure computation in constant rounds
• The Complexity of Zero Knowledge
• Bounded-concurrent secure multi-party computation with a dishonest majority
• Bounded-concurrent secure two-party computation without setup assumptions
• Lower bounds and impossibility results for concurrent self composition
• Concurrent composition in the bounded quantum storage model

This page was built for publication: Protocols for bounded-concurrent secure two-party computation in the plain model

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