Efficient secure two-party protocols. Techniques and constructions
From MaRDI portal
(Redirected from Publication:983160)
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
Cited in
(54)- Non-interactive half-aggregation of EdDSA and variants of Schnorr signatures
- Actively secure garbled circuits with constant communication overhead in the plain model
- Fast two-party signature for upgrading ECDSA to two-party scenario easily
- Secure parameterized pattern matching
- Making private function evaluation safer, faster, and simpler
- Brakedown: linear-time and field-agnostic SNARKs for R1CS
- A Multi-Party Protocol for Privacy-Preserving Cooperative Linear Systems of Equations
- Rogue-instance security for batch knowledge proofs
- Round optimal black-box ``commit-and-prove
- Automata evaluation and text search protocols with simulation-based security
- Fast cut-and-choose-based protocols for malicious and covert adversaries
- 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
- Oblivious DFA evaluation on joint input and its applications
- Robust publicly verifiable covert security: limited information leakage and guaranteed correctness with low overhead
- Formalising \(\varSigma\)-protocols and commitment schemes using crypthol
- Cryptographic reverse firewalls for interactive proof systems
- Half-tree: halving the cost of tree expansion in COT and DPF
- 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
- Computationally secure pattern matching in the presence of malicious adversaries
- SQIsignHD: new dimensions in cryptography
- A simple post-quantum non-interactive zero-knowledge proof from garbled circuits
- Improved zero-knowledge argument of encrypted extended permutation
- The price of active security in cryptographic protocols
- 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
- Compact, efficient and UC-secure isogeny-based oblivious transfer
- An improvement of multi-exponentiation with encrypted bases argument: smaller and faster
- Fast secure two-party ECDSA signing
- Efficient and secure outsourced approximate pattern matching protocol
- Black-box transformations from passive to covert security with public verifiability
- Achievable \textsf{CCA2} relaxation for homomorphic encryption
- 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
- scientific article; zbMATH DE number 4191075 (Why is no real title available?)
- \(k\)-critical graphs in \(P_5\)-free graphs
- Program synthesis for interactive-security systems
- \textsf{LR-OT}: leakage-resilient oblivious transfer
- How to simulate it -- a tutorial on the simulation proof technique
- Parallel repetition of \((k_1,\dots ,k_{\mu }) \)-special-sound multi-round interactive proofs
- 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
- Privacy preserving distributed optimization using homomorphic encryption
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)
