On the Power of Secure Two-Party Computation
From MaRDI portal
Recommendations
- On the power of secure two-party computation
- Data and Applications Security XIX
- scientific article; zbMATH DE number 1942420
- scientific article; zbMATH DE number 1418289
- Secure two-party computation is practical
- Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries
- Advances in Cryptology – CRYPTO 2004
- Efficient Two-Party Secure Computation on Committed Inputs
- Towards secure two-party computation from the wire-tap channel
- Towards characterizing securely computable two-party randomized functions
Cites work
- scientific article; zbMATH DE number 4191106 (Why is no real title available?)
- scientific article; zbMATH DE number 3856987 (Why is no real title available?)
- scientific article; zbMATH DE number 5485433 (Why is no real title available?)
- scientific article; zbMATH DE number 1256767 (Why is no real title available?)
- scientific article; zbMATH DE number 1030985 (Why is no real title available?)
- A language-dependent cryptographic primitive
- A minimal model for secure computation (extended abstract)
- A new interactive hashing theorem
- A proof of security of Yao's protocol for two-party computation
- Adaptive versus non-adaptive security of multi-party protocols
- Adaptive zero-knowledge proofs and adaptively secure oblivious transfer
- Adaptively secure garbled circuits from one-way functions
- Additively homomorphic UC commitments with optimal amortized overhead
- Advances in Cryptology – CRYPTO 2004
- An Equivalence Between Zero Knowledge and Commitments
- Bit commitment using pseudorandomness
- Black-box non-black-box zero knowledge
- Bounded key-dependent message security
- Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions
- Cryptography in NC^0
- Encoding functions with constant online rate or how to compress garbled circuits keys
- Founding Cryptography on Oblivious Transfer – Efficiently
- Founding Cryptography on Tamper-Proof Hardware Tokens
- From secrecy to soundness: efficient verification via secure computation (extended abstract)
- Improved OR-composition of sigma-protocols
- Key-dependent message security: generic amplification and completeness
- Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
- Non-interactive verifiable computing: outsourcing computation to untrusted workers
- OT-Combiners via Secure Computation
- One-Time Programs
- Perfect zero-knowledge arguments for NP using any one-way permutation
- Probabilistically checkable proofs of proximity with zero-knowledge
- Publicly Verifiable Non-Interactive Zero-Knowledge Proofs
- Resettably sound zero-knowledge arguments from OWFs -- the (semi) black-box way
- Scalable Secure Multiparty Computation
- Secure Arithmetic Computation with No Honest Majority
- Secure protocol transformations
- Secure two-party computation is practical
- Somewhat Non-committing Encryption and Efficient Adaptively Secure Oblivious Transfer
- The Knowledge Complexity of Interactive Proof Systems
- Theory of Cryptography
- Universally composable two-party and multi-party secure computation
- Zero-knowledge proofs from secure multiparty computation
Cited in
(32)- Black-box timed commitments from time-lock puzzles
- Adaptively secure computation for RAM programs
- Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries
- On statistical security in two-party computation
- Towards a unified approach to black-box constructions of zero-knowledge proofs
- Delayed-input cryptographic protocols
- Beyond MPC-in-the-head: black-box constructions of short zero-knowledge proofs
- Round-optimal fully black-box zero-knowledge arguments from one-way permutations
- Round optimal black-box ``commit-and-prove
- Covert two-party computation
- Fiat-Shamir for highly sound protocols is instantiable
- Concurrent non-malleable commitments (and more) in 3 rounds
- Fiat-Shamir for highly sound protocols is instantiable
- Zero-knowledge systems from MPC-in-the-head and oblivious transfer
- Steganography-free zero-knowledge
- Round-optimal black-box commit-and-prove with succinct communication
- On perfectly secure 2PC in the OT-hybrid model
- Triply adaptive UC NIZK
- Secure protocol transformations
- 3-message zero knowledge against human ignorance
- Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity
- On perfectly secure two-party computation for symmetric functionalities with correlated randomness
- Adaptively secure MPC with sublinear communication complexity
- On the power of secure two-party computation
- Hybrid zero-knowledge from garbled circuits and circuit-based composition of -protocols
- Crowd verifiable zero-knowledge and end-to-end verifiable multiparty computation
- Post-quantum simulatable extraction with minimal assumptions: black-box and constant-round
- Four-round black-box non-malleable schemes from one-way permutations
- Constant-round adaptive zero-knowledge proofs for NP
- The TinyTable protocol for 2-party secure computation, or: Gate-scrambling revisited
- Improved Secure Two-Party Computation via Information-Theoretic Garbled Circuits
- Efficient two-party exponentiation from quotient transfer
This page was built for publication: On the Power of Secure Two-Party Computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2829222)
