Two-round maliciously secure computation with super-polynomial simulation
From MaRDI portal
Publication:2695653
DOI10.1007/978-3-030-90459-3_22OpenAlexW3211814639MaRDI QIDQ2695653
Amit Agarwal, James Bartusek, Giulio Malavolta, Vipul Goyal, Dakshita Khurana
Publication date: 31 March 2023
Full work available at URL: https://doi.org/10.1007/978-3-030-90459-3_22
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Distributed systems (68M14)
Related Items
Maliciously-secure MrNISC in the plain model ⋮ Round-optimal black-box secure computation from two-round malicious OT
Cites Work
- Unnamed Item
- Unnamed Item
- Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs
- A proof of security of Yao's protocol for two-party computation
- Definitions and properties of zero-knowledge proof systems
- One-message zero knowledge and non-malleable commitments
- Two-round multiparty secure computation from minimal assumptions
- \(k\)-round multiparty computation from \(k\)-round oblivious transfer via garbled interactive circuits
- A new approach to round-optimal secure multiparty computation
- Distinguisher-dependent simulation in two rounds and its applications
- Four round secure computation without setup
- Round optimal concurrent MPC via strong simulation
- Two-message witness indistinguishability and secure computation in the plain model from new assumptions
- Promise zero knowledge and its applications to round optimal MPC
- Multiparty reusable non-interactive secure computation from LWE
- Succinct non-interactive secure computation
- Round optimal secure multiparty computation from minimal assumptions
- Reusable two-round MPC from DDH
- Mr NISC: multiparty reusable non-interactive secure computation
- Non-interactive non-malleability from quantum supremacy
- Computationally private randomizing polynomials and their applications
- New and Improved Key-Homomorphic Pseudorandom Functions
- New notions of security
- Perfect Non-interactive Zero Knowledge for NP
- Adaptive One-Way Functions and Applications
- Two-Round and Non-Interactive Concurrent Non-Malleable Commitments from Time-Lock Puzzles
- Round Optimal Blind Signatures
- Two-Round Adaptively Secure MPC from Indistinguishability Obfuscation
- Advances in Cryptology – CRYPTO 2004
- Efficient Round Optimal Blind Signatures
- Two-Round Secure MPC from Indistinguishability Obfuscation
- Non-interactive Zaps and New Techniques for NIZK
- Round-optimal secure multi-party computation
