Efficient secure two-party protocols. Techniques and constructions
From MaRDI portal
Publication:983160
DOI10.1007/978-3-642-14303-8zbMATH Open1208.68005OpenAlexW1666126665MaRDI QIDQ983160FDOQ983160
Authors: Carmit Hazay, Yehuda Lindell 
Publication date: 3 August 2010
Published in: Information Security and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-14303-8
Recommendations
- Engineering secure two-party computation protocols. Design, optimization, and applications of efficient secure function evaluation
- Techniques for Efficient Secure Computation Based on Yao’s Protocol
- Secure multiparty computation and secret sharing
- Secure two-party computation via cut-and-choose oblivious transfer
- Secure multi-party computation
distributed computingprotocolssearch problemsmultiparty computationcircuit computingstand alone modeltwo party computation
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Distributed systems (68M14) Network protocols (68M12)
Cited In (54)
- Non-interactive half-aggregation of EdDSA and variants of Schnorr signatures
- Fast two-party signature for upgrading ECDSA to two-party scenario easily
- Making private function evaluation safer, faster, and simpler
- Brakedown: linear-time and field-agnostic SNARKs for R1CS
- Secure parameterized pattern matching
- Rogue-instance security for batch knowledge proofs
- A Multi-Party Protocol for Privacy-Preserving Cooperative Linear Systems of Equations
- Round optimal black-box ``commit-and-prove
- Security of hedged Fiat-Shamir signatures under fault attacks
- A compressed \(\varSigma \)-protocol theory for lattices
- Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs
- Automata evaluation and text search protocols with simulation-based security
- Fast cut-and-choose-based protocols for malicious and covert adversaries
- Robust publicly verifiable covert security: limited information leakage and guaranteed correctness with low overhead
- Oblivious DFA evaluation on joint input and its applications
- Formalising \(\varSigma\)-protocols and commitment schemes using crypthol
- Half-tree: halving the cost of tree expansion in COT and DPF
- Cryptographic reverse firewalls for interactive proof systems
- An optimally fair coin toss
- Generic plaintext equality and inequality proofs
- How (not) to achieve both coercion resistance and cast as intended verifiability in remote evoting
- Secure two-party computation via cut-and-choose oblivious transfer
- The price of active security in cryptographic protocols
- A simple post-quantum non-interactive zero-knowledge proof from garbled circuits
- Improved zero-knowledge argument of encrypted extended permutation
- Computationally secure pattern matching in the presence of malicious adversaries
- Lattice-based signatures with tight adaptive corruptions and more
- Two-Prover Protocols---Low Error at Affordable Rates
- Efficient multi-party computation: from passive to active security via secure SIMD circuits
- Secure two-party input-size reduction: challenges, solutions and applications
- Efficient and secure generalized pattern matching via Fast Fourier Transform
- Fast secure two-party ECDSA signing
- Compact, efficient and UC-secure isogeny-based oblivious transfer
- An improvement of multi-exponentiation with encrypted bases argument: smaller and faster
- Black-box transformations from passive to covert security with public verifiability
- Efficient and secure outsourced approximate pattern matching protocol
- Efficient RSA key generation and threshold Paillier in the two-party setting
- Two-party ECDSA from hash proof systems and efficient instantiations
- Hierarchical and dynamic threshold Paillier cryptosystem without trusted dealer
- \(k\)-critical graphs in \(P_5\)-free graphs
- Title not available (Why is that?)
- Parallel repetition of \((k_1,\dots ,k_{\mu }) \)-special-sound multi-round interactive proofs
- Program synthesis for interactive-security systems
- How to simulate it -- a tutorial on the simulation proof technique
- Adaptive zero-knowledge proofs and adaptively secure oblivious transfer
- Engineering secure two-party computation protocols. Design, optimization, and applications of efficient secure function evaluation
- Achievable \textsf{CCA2} relaxation for homomorphic encryption
- Secure extended wildcard pattern matching protocol from cut-and-choose oblivious transfer
- The simplest protocol for oblivious transfer
- Actively secure garbled circuits with constant communication overhead in the plain model
- Privacy preserving distributed optimization using homomorphic encryption
- SQIsignHD: new dimensions in cryptography
- Achievable \textsf{CCA2} relaxation for homomorphic encryption
- \textsf{LR-OT}: leakage-resilient oblivious transfer
This page was built for publication: Efficient secure two-party protocols. Techniques and constructions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q983160)
