Black-box transformations from passive to covert security with public verifiability
From MaRDI portal
Publication:2096543
DOI10.1007/978-3-030-56880-1_23OpenAlexW3046593469MaRDI QIDQ2096543
Mark Simkin, Claudio Orlandi, Ivan B. Damgård
Publication date: 9 November 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-56880-1_23
Cryptography (94A60) Theory of compilers and interpreters (68N20) Data encryption (aspects in computer science) (68P25)
Related Items
Making Private Function Evaluation Safer, Faster, and Simpler ⋮ Putting the online phase on a diet: covert security from short MACs ⋮ Financially backed covert security ⋮ Generic compiler for publicly verifiable covert multi-party computation ⋮ On publicly-accountable zero-knowledge and small shuffle arguments ⋮ Efficient compiler to covert security with public verifiability for honest majority MPC
Cites Work
- Unnamed Item
- Efficient secure two-party protocols. Techniques and constructions
- Perfect secure computation in two rounds
- Yet another compiler for active security or: efficient MPC over arbitrary rings
- How to construct constant-round zero-knowledge proof systems for NP
- Player simulation and general adversary structures in perfect multiparty computation
- Covert security with public verifiability: faster, leaner, and simpler
- Two round information-theoretic MPC with malicious security
- Public Verifiability in the Covert Model (Almost) for Free
- Efficient Multiparty Protocols via Log-Depth Threshold Formulae
- Multiparty Computation from Somewhat Homomorphic Encryption
- Practical Covertly Secure MPC for Dishonest Majority – Or: Breaking the SPDZ Limits
- From Passive to Covert Security at Low Cost
- Covert two-party computation
- Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries
- Founding Cryptography on Oblivious Transfer – Efficiently
- An O (log n ) expected rounds randomized byzantine generals protocol
- Calling Out Cheaters: Covert Security with Public Verifiability
- How to Simulate It – A Tutorial on the Simulation Proof Technique
- The IPS Compiler: Optimizations, Variants and Concrete Efficiency
- Advances in Cryptology - CRYPTO 2003
- Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
- Efficient Two Party and Multi Party Computation Against Covert Adversaries
