Parallel coin-tossing and constant-round secure two-party computation
From MaRDI portal
Publication:1402368
DOI10.1007/s00145-002-0143-7zbMath1027.94011OpenAlexW2089592270MaRDI QIDQ1402368
Publication date: 27 August 2003
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-002-0143-7
Related Items (26)
Concurrent knowledge extraction in public-key models ⋮ A compressed \(\varSigma \)-protocol theory for lattices ⋮ Compressing proofs of \(k\)-out-of-\(n\) partial knowledge ⋮ Time- and space-efficient arguments from groups of unknown order ⋮ An optimally fair coin toss ⋮ Improved zero-knowledge argument of encrypted extended permutation ⋮ A verifiable secret shuffle of homomorphic encryptions ⋮ A note on constant-round zero-knowledge proofs of knowledge ⋮ Secure two-party computation via cut-and-choose oblivious transfer ⋮ An optimized inner product argument with more application scenarios ⋮ Compressed $$\varSigma $$-Protocols for Bilinear Group Arithmetic Circuits and Application to Logarithmic Transparent Threshold Signatures ⋮ Efficient unique ring signatures from lattices ⋮ Towards practical homomorphic time-lock puzzles: applicability and verifiability ⋮ A new interactive hashing theorem ⋮ Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries ⋮ Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries ⋮ Protocols for multiparty coin toss with a dishonest majority ⋮ A note on universal composable zero-knowledge in the common reference string model ⋮ SPARKs: succinct parallelizable arguments of knowledge ⋮ Post-quantum multi-party computation ⋮ Efficient range proofs with transparent setup from bounded integer commitments ⋮ An improvement of multi-exponentiation with encrypted bases argument: smaller and faster ⋮ Handling expected polynomial-time strategies in simulation-based security proofs ⋮ Reducing complexity assumptions for statistically-hiding commitment ⋮ Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments ⋮ Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics
This page was built for publication: Parallel coin-tossing and constant-round secure two-party computation
