Pages that link to "Item:Q5212848"
From MaRDI portal
The following pages link to Fiat-Shamir: from practice to theory (Q5212848):
Displaying 50 items.
- Compact designated verifier NIZKs from the CDH assumption without pairings (Q2051369) (← links)
- Transparent SNARKs from DARK compilers (Q2055634) (← links)
- Compact NIZKs from standard assumptions on bilinear maps (Q2055661) (← links)
- Non-interactive zero-knowledge in pairing-free groups from weaker assumptions (Q2055663) (← links)
- Statistical ZAPR arguments from bilinear maps (Q2055670) (← links)
- Statistical ZAP arguments (Q2055672) (← links)
- Statistical Zaps and new oblivious transfer protocols (Q2055674) (← links)
- Non-interactive zero knowledge from sub-exponential DDH (Q2056667) (← links)
- Public-coin statistical zero-knowledge batch verification against malicious verifiers (Q2056790) (← links)
- Bifurcated signatures: folding the accountability vs. anonymity dilemma into a single private signing scheme (Q2056805) (← links)
- A lattice-based fully dynamic group signature scheme without NIZK (Q2057162) (← links)
- Non-interactive CCA2-secure threshold cryptosystems: achieving adaptive security in the standard model without pairings (Q2061939) (← links)
- Single-to-multi-theorem transformations for non-interactive statistical zero-knowledge (Q2061955) (← links)
- Flexible and efficient verifiable computation on encrypted data (Q2061972) (← links)
- Interactive proofs for social graphs (Q2102081) (← links)
- Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs (Q2104234) (← links)
- Delegation with updatable unambiguous proofs and PPAD-hardness (Q2104236) (← links)
- New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust (Q2104237) (← links)
- NIZK from LPN and trapdoor hash via correlation intractability for approximable relations (Q2104241) (← links)
- Non-interactive zero-knowledge arguments for QMA, with preprocessing (Q2104244) (← links)
- Compact ring signatures from learning with errors (Q2120080) (← links)
- Multi-theorem designated-verifier NIZK for QMA (Q2120083) (← links)
- \textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments (Q2120097) (← links)
- Sumcheck arguments and their applications (Q2120101) (← links)
- Tight state-restoration soundness in the algebraic group model (Q2128989) (← links)
- \textsf{Mac'n'Cheese}: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctions (Q2139630) (← links)
- Does Fiat-Shamir require a cryptographic hash function? (Q2139639) (← links)
- Non-interactive batch arguments for NP from standard assumptions (Q2139642) (← links)
- A PCP theorem for interactive proofs and applications (Q2170038) (← links)
- Fiat-Shamir bulletproofs are non-malleable (in the algebraic group model) (Q2170055) (← links)
- One-shot Fiat-Shamir-based NIZK arguments of composite residuosity and logarithmic-size ring signatures in the standard model (Q2170058) (← links)
- SNARGs for P from sub-exponential DDH and QR (Q2170061) (← links)
- Succinct arguments in the quantum random oracle model (Q2175929) (← links)
- CPA-to-CCA transformation for KDM security (Q2175934) (← links)
- Permuted puzzles and cryptographic hardness (Q2175950) (← links)
- On the (In)security of Kilian-based SNARGs (Q2175953) (← links)
- Toward non-interactive zero-knowledge proofs for NP from LWE (Q2661693) (← links)
- Non-interactive composition of sigma-protocols via Share-then-Hash (Q2691604) (← links)
- Individual simulations (Q2691606) (← links)
- Circular security is complete for KDM security (Q2692344) (← links)
- Somewhere statistical soundness, post-quantum security, and SNARGs (Q2695640) (← links)
- Fully-succinct publicly verifiable delegation from constant-size assumptions (Q2695648) (← links)
- Oblivious transfer from trapdoor permutations in minimal rounds (Q2697874) (← links)
- Simulatable verifiable random function from the LWE assumption (Q2700784) (← links)
- On Black-Box Extensions of Non-interactive Zero-Knowledge Arguments, and Signatures Directly from Simulation Soundness (Q5041170) (← links)
- Rational Modular Encoding in the DCR Setting: Non-interactive Range Proofs and Paillier-Based Naor-Yung in the Standard Model (Q5087275) (← links)
- Multi-theorem preprocessing NIZKs from lattices (Q5918862) (← links)
- Ligero: lightweight sublinear arguments without a trusted setup (Q6063128) (← links)
- Batch arguments for \textsf{NP} and more from standard bilinear group assumptions (Q6104342) (← links)
- NIZK from SNARGs (Q6110372) (← links)
