On the Exact Round Complexity of Self-composable Two-Party Computation
From MaRDI portal
Publication:5738974
DOI10.1007/978-3-319-56614-6_7zbMath1410.94072OpenAlexW2592566690MaRDI QIDQ5738974
Sanjam Garg, Susumu Kiyoshima, Omkant Pandey
Publication date: 13 June 2017
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-56614-6_7
Related Items (4)
One-message zero knowledge and non-malleable commitments ⋮ Round-optimal black-box secure computation from two-round malicious OT ⋮ Concurrently composable non-interactive secure computation ⋮ Round-optimal secure multi-party computation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A proof of security of Yao's protocol for two-party computation
- Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions
- Round-Efficient Black-Box Construction of Composable Multi-Party Computation
- Concurrently Secure Computation in Constant Rounds
- Black-Box Constructions of Composable Protocols without Set-Up
- Lossy Encryption: Constructions from General Assumptions and Efficient Selective Opening Chosen Ciphertext Security
- Round-Optimal Black-Box Two-Party Computation
- Lossy trapdoor functions and their applications
- Bounded-concurrent secure multi-party computation with a dishonest majority
- New notions of security
- Bounded-concurrent secure two-party computation without setup assumptions
- Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
- Publicly Verifiable Non-Interactive Zero-Knowledge Proofs
- A Unified Framework for UC from Only OT
- On Concurrently Secure Computation in the Multiple Ideal Query Model
- A unified framework for concurrent security
- Non-malleability amplification
- Round-Efficient Concurrently Composable Secure Computation via a Robust Extraction Lemma
- Advances in Cryptology – CRYPTO 2004
- Textbook non-malleable commitments
- Zaps and Their Applications
- The Exact Round Complexity of Secure Computation
- Constant-Round Black-Box Construction of Composable Multi-Party Computation Protocol
- Theory of Cryptography
- Theory of Cryptography
This page was built for publication: On the Exact Round Complexity of Self-composable Two-Party Computation