Pages that link to "Item:Q1648782"

The following pages link to Fiat-Shamir and correlation intractability from strong KDM-secure encryption (Q1648782):

Displaying 28 items.

• Fiat-Shamir and correlation intractability from strong KDM-secure encryption (Q1648782) (← links)
• Proofs of Work from worst-case assumptions (Q1673424) (← links)
• Compact designated verifier NIZKs from the CDH assumption without pairings (Q2051369) (← links)
• Compact NIZKs from standard assumptions on bilinear maps (Q2055661) (← links)
• Non-interactive zero-knowledge in pairing-free groups from weaker assumptions (Q2055663) (← links)
• Non-interactive zero knowledge from sub-exponential DDH (Q2056667) (← links)
• Single-to-multi-theorem transformations for non-interactive statistical zero-knowledge (Q2061955) (← links)
• Interactive proofs for social graphs (Q2102081) (← links)
• Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs (Q2104234) (← links)
• NIZK from LPN and trapdoor hash via correlation intractability for approximable relations (Q2104241) (← links)
• Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages (Q2104242) (← links)
• \textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments (Q2120097) (← links)
• Does Fiat-Shamir require a cryptographic hash function? (Q2139639) (← links)
• Non-interactive batch arguments for NP from standard assumptions (Q2139642) (← links)
• A pairing-free signature scheme from correlation intractable hash function and strong Diffie-Hellman assumption (Q2152147) (← links)
• One-shot Fiat-Shamir-based NIZK arguments of composite residuosity and logarithmic-size ring signatures in the standard model (Q2170058) (← 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)
• Secure MPC: laziness leads to GOD (Q2691583) (← links)
• Non-interactive composition of sigma-protocols via Share-then-Hash (Q2691604) (← links)
• Circular security is complete for KDM security (Q2692344) (← links)
• Somewhere statistical soundness, post-quantum security, and SNARGs (Q2695640) (← links)
• Statistical ZAPs from group-based assumptions (Q2695645) (← links)
• The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO (Q5041157) (← links)
• Multi-theorem preprocessing NIZKs from lattices (Q5918862) (← links)
• NIZK from SNARGs (Q6110372) (← links)