On the Power of Secure Two-Party Computation
From MaRDI portal
Publication:2829222
DOI10.1007/978-3-662-53008-5_14zbMath1372.94429OpenAlexW2400112050MaRDI QIDQ2829222
Muthuramakrishnan Venkitasubramaniam, Carmit Hazay
Publication date: 27 October 2016
Published in: Advances in Cryptology – CRYPTO 2016 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-53008-5_14
secure two-party computationrandomized encodinginstance-dependent commitmentsadaptive zero-knowledge proofsinteractive hashing
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Network protocols (68M12)
Related Items (18)
Round-optimal fully black-box zero-knowledge arguments from one-way permutations ⋮ Round optimal black-box ``commit-and-prove ⋮ Towards a unified approach to black-box constructions of zero-knowledge proofs ⋮ Fiat-Shamir for highly sound protocols is instantiable ⋮ 3-Message Zero Knowledge Against Human Ignorance ⋮ Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity ⋮ Adaptively secure computation for RAM programs ⋮ Post-quantum simulatable extraction with minimal assumptions: black-box and constant-round ⋮ Four-round black-box non-malleable schemes from one-way permutations ⋮ Triply adaptive UC NIZK ⋮ Steganography-free zero-knowledge ⋮ Crowd verifiable zero-knowledge and end-to-end verifiable multiparty computation ⋮ Delayed-input cryptographic protocols ⋮ Adaptively secure MPC with sublinear communication complexity ⋮ Fiat–Shamir for Highly Sound Protocols Is Instantiable ⋮ Secure Protocol Transformations ⋮ Concurrent Non-Malleable Commitments (and More) in 3 Rounds ⋮ Round-optimal black-box commit-and-prove with succinct communication
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Adaptive zero-knowledge proofs and adaptively secure oblivious transfer
- A language-dependent cryptographic primitive
- Key-dependent message security: generic amplification and completeness
- Bit commitment using pseudorandomness
- A proof of security of Yao's protocol for two-party computation
- Perfect zero-knowledge arguments for NP using any one-way permutation
- Adaptive versus non-adaptive security of multi-party protocols
- A new interactive hashing theorem
- Improved OR-Composition of Sigma-Protocols
- A minimal model for secure computation (extended abstract)
- Secure Protocol Transformations
- Adaptively Secure Garbled Circuits from One-Way Functions
- Encoding Functions with Constant Online Rate or How to Compress Garbled Circuits Keys
- Additively Homomorphic UC Commitments with Optimal Amortized Overhead
- Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions
- Somewhat Non-committing Encryption and Efficient Adaptively Secure Oblivious Transfer
- Founding Cryptography on Tamper-Proof Hardware Tokens
- Bounded Key-Dependent Message Security
- Zero-Knowledge Proofs from Secure Multiparty Computation
- Universally composable two-party and multi-party secure computation
- Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
- From Secrecy to Soundness: Efficient Verification via Secure Computation
- One-Time Programs
- Founding Cryptography on Oblivious Transfer – Efficiently
- Secure Arithmetic Computation with No Honest Majority
- Secure Two-Party Computation Is Practical
- The Knowledge Complexity of Interactive Proof Systems
- Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
- Publicly Verifiable Non-Interactive Zero-Knowledge Proofs
- Black-box non-black-box zero knowledge
- Resettably Sound Zero-Knowledge Arguments from OWFs - The (Semi) Black-Box Way
- Advances in Cryptology – CRYPTO 2004
- OT-Combiners via Secure Computation
- An Equivalence Between Zero Knowledge and Commitments
- Probabilistically Checkable Proofs of Proximity with Zero-Knowledge
- Scalable Secure Multiparty Computation
- Cryptography in $NC^0$
- Theory of Cryptography
This page was built for publication: On the Power of Secure Two-Party Computation
