Bounded-concurrent secure two-party computation without setup assumptions

DOI10.1145/780542.780641zbMath1192.94123OpenAlexW1988909447MaRDI QIDQ3581307

Yehuda Lindell

Publication date: 16 August 2010

Published in: Proceedings of the thirty-fifth annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/780542.780641

Mathematics Subject Classification ID

Network protocols (68M12) Authentication, digital signatures and secret sharing (94A62)

Related Items (18)

On the concurrent composition of quantum zero-knowledge ⋮ On the security loss of unique signatures ⋮ Unbounded ABE via bilinear entropy expansion, revisited ⋮ Lower bounds and impossibility results for concurrent self composition ⋮ A universally composable non-interactive aggregate cash system ⋮ On concurrent multi-party quantum computation ⋮ Secure computation without authentication ⋮ Computing boundary cycle of a pseudo-triangle polygon from its visibility graph ⋮ Cryptography Using Captcha Puzzles ⋮ On the Exact Round Complexity of Self-composable Two-Party Computation ⋮ Magic Adversaries Versus Individual Reduction: Science Wins Either Way ⋮ Equivocal Blind Signatures and Adaptive UC-Security ⋮ Local Sequentiality Does Not Help for Concurrent Composition ⋮ Resettably Secure Computation ⋮ Practical Round-Optimal Blind Signatures in the Standard Model from Weaker Assumptions ⋮ General composition and universal composability in secure multiparty computation ⋮ Two-Message, Oblivious Evaluation of Cryptographic Functionalities ⋮ Efficient Round-Optimal Blind Signatures in the Standard Model

This page was built for publication: Bounded-concurrent secure two-party computation without setup assumptions