Zero-knowledge protocols with PVC security: striking the balance between security and efficiency
From MaRDI portal
Cites work
- Better concrete security for half-gates garbling (in the multi-instance setting)
- Black-box transformations from passive to covert security with public verifiability
- Blind polynomial evaluation and data trading
- Calling out cheaters: covert security with public verifiability
- Covert security with public verifiability: faster, leaner, and simpler
- Efficient compiler to covert security with public verifiability for honest majority MPC
- Efficient secure two-party protocols. Techniques and constructions
- Encryption switching protocols
- Financially backed covert security
- Generic compiler for publicly verifiable covert multi-party computation
- How to construct constant-round zero-knowledge proof systems for NP
- How to simulate it -- a tutorial on the simulation proof technique
- scientific article; zbMATH DE number 4191111 (Why is no real title available?)
- Making private function evaluation safer, faster, and simpler
- On the size of pairing-based non-interactive arguments
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- Public verifiability in the covert model (almost) for free
- Quadratic span programs and succinct NIZKs without PCPs
- Robust publicly verifiable covert security: limited information leakage and guaranteed correctness with low overhead
- The knowledge complexity of interactive proof-systems
This page was built for publication: Zero-knowledge protocols with PVC security: striking the balance between security and efficiency
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6846319)
