Bounded-concurrent secure two-party computation without setup assumptions

DOI10.1145/780542.780641zbMath1192.94123MaRDI 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

68M12: Network protocols

94A62: Authentication, digital signatures and secret sharing

Related Items

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