Efficient secure two-party protocols. Techniques and constructions
From MaRDI portal
Publication:983160
DOI10.1007/978-3-642-14303-8zbMath1208.68005OpenAlexW1666126665MaRDI QIDQ983160
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
distributed computingsearch problemsprotocolsmultiparty computationcircuit computingstand alone modeltwo party computation
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Distributed systems (68M14) Network protocols (68M12)
Related Items (45)
Non-interactive half-aggregation of EdDSA and variants of Schnorr signatures ⋮ A compressed \(\varSigma \)-protocol theory for lattices ⋮ Automata evaluation and text search protocols with simulation-based security ⋮ Fast cut-and-choose-based protocols for malicious and covert adversaries ⋮ Round optimal black-box ``commit-and-prove ⋮ An optimally fair coin toss ⋮ Efficient Multi-party Computation: From Passive to Active Security via Secure SIMD Circuits ⋮ Generic plaintext equality and inequality proofs ⋮ How (not) to achieve both coercion resistance and cast as intended verifiability in remote evoting ⋮ A simple post-quantum non-interactive zero-knowledge proof from garbled circuits ⋮ Improved zero-knowledge argument of encrypted extended permutation ⋮ Secure parameterized pattern matching ⋮ Making Private Function Evaluation Safer, Faster, and Simpler ⋮ The Simplest Protocol for Oblivious Transfer ⋮ Secure two-party computation via cut-and-choose oblivious transfer ⋮ A Multi-Party Protocol for Privacy-Preserving Cooperative Linear Systems of Equations ⋮ Secure two-party input-size reduction: challenges, solutions and applications ⋮ Efficient RSA key generation and threshold Paillier in the two-party setting ⋮ Lattice-based signatures with tight adaptive corruptions and more ⋮ Achievable \textsf{CCA2} relaxation for homomorphic encryption ⋮ Fast two-party signature for upgrading ECDSA to two-party scenario easily ⋮ Brakedown: linear-time and field-agnostic SNARKs for R1CS ⋮ Parallel repetition of \((k_1,\dots ,k_{\mu }) \)-special-sound multi-round interactive proofs ⋮ Program synthesis for interactive-security systems ⋮ Half-tree: halving the cost of tree expansion in COT and DPF ⋮ Privacy preserving distributed optimization using homomorphic encryption ⋮ Cryptographic reverse firewalls for interactive proof systems ⋮ Adaptive zero-knowledge proofs and adaptively secure oblivious transfer ⋮ Efficient and Secure Generalized Pattern Matching via Fast Fourier Transform ⋮ Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs ⋮ Actively secure garbled circuits with constant communication overhead in the plain model ⋮ Oblivious DFA evaluation on joint input and its applications ⋮ Secure extended wildcard pattern matching protocol from cut-and-choose oblivious transfer ⋮ Fast secure two-party ECDSA signing ⋮ From fairness to full security in multiparty computation ⋮ Formalising \(\varSigma\)-protocols and commitment schemes using crypthol ⋮ Efficient and secure outsourced approximate pattern matching protocol ⋮ \(k\)-critical graphs in \(P_5\)-free graphs ⋮ Computationally secure pattern matching in the presence of malicious adversaries ⋮ Security of hedged Fiat-Shamir signatures under fault attacks ⋮ 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 ⋮ How to Simulate It – A Tutorial on the Simulation Proof Technique ⋮ Hierarchical and dynamic threshold Paillier cryptosystem without trusted dealer
This page was built for publication: Efficient secure two-party protocols. Techniques and constructions
