Robust non-interactive zero-knowledge combiners
From MaRDI portal
Cites work
- A Pseudorandom Generator from any One-way Function
- Amplification of non-interactive zero knowledge, revisited
- Amplifying Collision Resistance: A Complexity-Theoretic Treatment
- An efficient transform from sigma protocols to NIZK with a CRS and non-programmable random oracle
- Bit commitment using pseudorandomness
- Breaking and Fixing Cryptophia’s Short Combiner
- Combiners for functional encryption, unconditionally
- Compression from Collisions, or Why CRHF Combiners Have a Long Output
- Cryptography in the Multi-string Model
- Cryptophia's short combiner for collision-resistant hash functions
- From FE combiners to secure MPC and back
- Hash combiners for second pre-image resistance, target collision resistance and pre-image resistance have long output
- How to use indistinguishability obfuscation
- scientific article; zbMATH DE number 5485433 (Why is no real title available?)
- scientific article; zbMATH DE number 2009960 (Why is no real title available?)
- Improved OR-composition of sigma-protocols
- KEM combiners
- Multi-property Preserving Combiners for Hash Functions
- Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
- New constructions of statistical NIZKs: dual-mode DV-NIZKs and more
- New techniques for noninteractive zero-knowledge
- Non-trivial Black-Box Combiners for Collision-Resistant Hash-Functions Don’t Exist
- Obfuscation combiners
- On Robust Combiners for Oblivious Transfer and Other Primitives
- On Robust Combiners for Private Information Retrieval and Other Primitives
- On the Impossibility of Efficiently Combining Collision Resistant Hash Functions
- One-out-of-q OT combiners
- Online/offline OR composition of sigma protocols
- Perfect Non-interactive Zero Knowledge for NP
- Random oracle combiners: breaking the concatenation barrier for collision-resistance
- Resource-efficient OT combiners with active security
- Robust multi-property combiners for hash functions
- Robust Multi-property Combiners for Hash Functions Revisited
- Robust transforming combiners from indistinguishability obfuscation to functional encryption
- Robuster Combiners for Oblivious Transfer
- Simultaneous amplification: the case of non-interactive zero-knowledge
- Theory of Cryptography
- Topics in Cryptology – CT-RSA 2005
- Unconditional Characterizations of Non-interactive Zero-Knowledge
- Unifying Zero-Knowledge Proofs of Knowledge
- Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption
This page was built for publication: Robust non-interactive zero-knowledge combiners
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7305299)
