Efficient concurrent zero-knowledge in the auxiliary string model
From MaRDI portal
Publication:3374926
Recommendations
Cited in
(43)- Efficient zero-knowledge proof of algebraic and non-algebraic statements with applications to privacy preserving credentials
- Concurrently Non-malleable Black-Box Zero Knowledge in the Bare Public-Key Model
- On the Portability of Generalized Schnorr Proofs
- Concurrent knowledge extraction in public-key models
- Secure parameterized pattern matching
- Improved constructions of anonymous credentials from structure-preserving signatures on equivalence classes
- A transform for NIZK almost as efficient and general as the Fiat-Shamir transform without programmable random oracles
- On the relationship between statistical zero-knowledge and statistical randomized encodings
- On the relationship between statistical zero-knowledge and statistical randomized encodings
- Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption
- SnarkPack: practical SNARK aggregation
- Efficient set operations in the presence of malicious adversaries
- Fiat-Shamir for highly sound protocols is instantiable
- Fiat-Shamir for highly sound protocols is instantiable
- Equivocal Blind Signatures and Adaptive UC-Security
- Compact E-Cash and Simulatable VRFs Revisited
- A note on universal composable zero-knowledge in the common reference string model
- Structure-preserving signatures on equivalence classes and constant-size anonymous credentials
- Anonymous authentication with optional shared anonymity revocation and linkability
- Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions
- A verifiable secret shuffle of homomorphic encryptions
- Rational modular encoding in the DCR setting: non-interactive range proofs and Paillier-based Naor-Yung in the standard model
- Hybrid commitments and their applications to zero-knowledge proof systems
- Lattice-Based Group Encryption with Full Dynamicity and Message Filtering Policy
- SIDH proof of knowledge
- Everlasting UC commitments from fully malicious PUFs
- Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices
- Efficient oblivious transfer from lossy threshold homomorphic encryption
- Lattice-based e-cash, revisited
- Designated confirmer signatures with unified verification
- One-shot Fiat-Shamir-based NIZK arguments of composite residuosity and logarithmic-size ring signatures in the standard model
- Dynamic Universal Accumulators for DDH Groups and Their Application to Attribute-Based Anonymous Credential Systems
- Concurrent zero knowledge, revisited
- Chopsticks: fork-free two-round multi-signatures from non-interactive assumptions
- Group Encryption
- Non-interactive CCA2-secure threshold cryptosystems: achieving adaptive security in the standard model without pairings
- Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices
- Dual-mode NIZKs: possibility and impossibility results for property transfer
- Improved algebraic MACs and practical keyed-verification anonymous credentials
- Efficient, adaptively secure, and composable oblivious transfer with a single, global CRS
- New Constructions and Applications of Trapdoor DDH Groups
- Threshold Homomorphic Encryption in the Universally Composable Cryptographic Library
- Always have a backup plan: fully secure synchronous MPC with asynchronous fallback
This page was built for publication: Efficient concurrent zero-knowledge in the auxiliary string model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3374926)
