On adaptive security of delayed-input sigma protocols and Fiat-Shamir NIZKs
From MaRDI portal
Publication:2106675
Recommendations
- Triply adaptive UC NIZK
- An efficient transform from sigma protocols to NIZK with a CRS and non-programmable random oracle
- Adaptive proofs have straightline extractors (in the random oracle model)
- Fiat-Shamir for highly sound protocols is instantiable
- Fiat-Shamir for highly sound protocols is instantiable
Cited in
(16)- DAG-\( \Sigma \): a DAG-based sigma protocol for relations in CNF
- Adaptive proofs have straightline extractors (in the random oracle model)
- An efficient transform from sigma protocols to NIZK with a CRS and non-programmable random oracle
- Delayed-input cryptographic protocols
- Does Fiat-Shamir require a cryptographic hash function?
- Non-interactive batch arguments for NP from standard assumptions
- Online/offline OR composition of sigma protocols
- Triply adaptive UC NIZK
- Rational modular encoding in the DCR setting: non-interactive range proofs and Paillier-based Naor-Yung in the standard model
- One-shot Fiat-Shamir-based NIZK arguments of composite residuosity and logarithmic-size ring signatures in the standard model
- PPAD is as hard as LWE and iterated squaring
- Non-interactive CCA2-secure threshold cryptosystems: achieving adaptive security in the standard model without pairings
- Oblivious transfer from trapdoor permutations in minimal rounds
- Multi-theorem Fiat-Shamir transform from correlation-intractable hash functions
- Simulatable verifiable random function from the LWE assumption
- Four-round black-box non-malleable schemes from one-way permutations
This page was built for publication: On adaptive security of delayed-input sigma protocols and Fiat-Shamir NIZKs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2106675)
