Bounded-concurrent secure two-party computation without setup assumptions

DOI10.1145/780542.780641MaRDI QIDQ3581307zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Protocols for bounded-concurrent secure two-party computation in the plain model
• Bounded-concurrent secure multi-party computation with a dishonest majority
• On the limitations of universally composable two-party computation without set-up assumptions
• Black-box constructions of composable protocols without set-up
• Black-box constructions of bounded-concurrent secure computation

Cited in

(35)

• 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
• Black-box constructions of bounded-concurrent secure computation
• On the concurrent composition of quantum zero-knowledge
• Lower bounds and impossibility results for concurrent self composition
• On the limitations of universally composable two-party computation without set-up assumptions
• Practical Round-Optimal Blind Signatures in the Standard Model from Weaker Assumptions
• Two-message, oblivious evaluation of cryptographic functionalities
• Impossibility results for static input secure computation
• Black-box constructions of composable protocols without set-up
• Unconditionally Secure Homomorphic Pre-distributed Bit Commitment and Secure Two-Party Computations
• Bounded-concurrent secure multi-party computation with a dishonest majority
• Protocols for bounded-concurrent secure two-party computation in the plain model
• On the Necessity of Rewinding in Secure Multiparty Computation
• Local Sequentiality Does Not Help for Concurrent Composition
• Resettably Secure Computation
• scientific article; zbMATH DE number 2009949 (Why is no real title available?)
• Cryptography using \texttt{CAPTCHA} puzzles
• Cross-domain secure computation
• Equivocal Blind Signatures and Adaptive UC-Security
• Secure Computation Without Authentication
• 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
• Theory of Cryptography
• A universally composable non-interactive aggregate cash system
• On concurrent multi-party quantum computation
• Secure computation without authentication
• Two-round concurrent 2PC from sub-exponential LWE
• Improved black-box constructions of composable secure computation
• Round-efficient composable two-party quantum computation
• On the limits of non-interactive blind signatures
• Is it even possible? On the parallel composition of asynchronous MPC protocols

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

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