Fiat-Shamir and correlation intractability from strong KDM-secure encryption
From MaRDI portal
Publication:1648782
DOI10.1007/978-3-319-78381-9_4zbMath1423.94058OpenAlexW2795247010MaRDI QIDQ1648782
Ran Canetti, Leonid Reyzin, Ron D. Rothblum, Yilei Chen
Publication date: 9 July 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-78381-9_4
Related Items
\textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments, The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO, Does Fiat-Shamir require a cryptographic hash function?, Non-interactive batch arguments for NP from standard assumptions, A pairing-free signature scheme from correlation intractable hash function and strong Diffie-Hellman assumption, Fiat-Shamir and correlation intractability from strong KDM-secure encryption, One-shot Fiat-Shamir-based NIZK arguments of composite residuosity and logarithmic-size ring signatures in the standard model, Toward non-interactive zero-knowledge proofs for NP from LWE, Proofs of Work from worst-case assumptions, CPA-to-CCA transformation for KDM security, Permuted puzzles and cryptographic hardness, On the (In)security of Kilian-based SNARGs, SNARGs and PPAD hardness from the decisional Diffie-Hellman assumption, A generic transform from multi-round interactive proof to NIZK, NIZK from SNARGs, Efficient NIZKs from LWE via polynomial reconstruction and ``MPC in the head, Efficient leakage-resilient MACs without idealized assumptions, Time-release cryptography from minimal circuit assumptions, PPAD is as hard as LWE and iterated squaring, Correlation intractability and SNARGs from sub-exponential DDH, A note on non-interactive zero-knowledge from CDH, Secure MPC: laziness leads to GOD, Non-interactive composition of sigma-protocols via Share-then-Hash, Circular security is complete for KDM security, Somewhere statistical soundness, post-quantum security, and SNARGs, Statistical ZAPs from group-based assumptions, Multi-theorem preprocessing NIZKs from lattices, Compact designated verifier NIZKs from the CDH assumption without pairings, Compact NIZKs from standard assumptions on bilinear maps, Non-interactive zero-knowledge in pairing-free groups from weaker assumptions, Non-interactive zero knowledge from sub-exponential DDH, Single-to-multi-theorem transformations for non-interactive statistical zero-knowledge, Interactive proofs for social graphs, Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs, NIZK from LPN and trapdoor hash via correlation intractability for approximable relations, Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem
- Key-dependent message security: generic amplification and completeness
- On the concrete hardness of learning with errors
- Recent progress on the elliptic curve discrete logarithm problem
- Probabilistic encryption
- On Lovász' lattice reduction and the nearest lattice point problem
- Discrete logarithms in \(\mathrm{GF}(p)\)
- A hierarchy of polynomial time lattice basis reduction algorithms
- Factoring polynomials with rational coefficients
- Constructive and destructive facets of Weil descent on elliptic curves
- Fiat-Shamir and correlation intractability from strong KDM-secure encryption
- From obfuscation to the security of Fiat-Shamir for proofs
- On the asymptotic complexity of solving LWE
- Lower bounds for non-black-box zero knowledge
- On the Correlation Intractability of Obfuscated Pseudorandom Functions
- Algebraic Approaches for the Elliptic Curve Discrete Logarithm Problem over Prime Fields
- The Magic of ELFs
- Hardness of SIS and LWE with Small Parameters
- Instantiating Random Oracles via UCEs
- Randomness Condensers for Efficiently Samplable, Seed-Dependent Sources
- Correlated-Input Secure Hash Functions
- Black-Box Circular-Secure Encryption beyond Affine Functions
- New Algorithms for Learning in Presence of Errors
- The random oracle methodology, revisited
- Better Key Sizes (and Attacks) for LWE-Based Encryption
- On the discrete logarithm problem in elliptic curves
- Interactive Oracle Proofs
- Probabilistically Checkable Arguments
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- On Symmetric Encryption and Point Obfuscation
- Magic Functions
- An Improved BKW Algorithm for LWE with Applications to Cryptography and Lattices
- Bounded Key-Dependent Message Security
- Circular and Leakage Resilient Public-Key Encryption under Subgroup Indistinguishability
- Circular-Secure Encryption from Decision Diffie-Hellman
- On the (Im)Possibility of Key Dependent Encryption
- Lattice-based Cryptography
- Foundations of Non-malleable Hash and One-Way Functions
- A public key cryptosystem and a signature scheme based on discrete logarithms
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- A monte carlo method for factorization
- A Pseudorandom Generator from any One-way Function
- Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
- Reducing elliptic curve logarithms to logarithms in a finite field
- The knowledge complexity of interactive proof-systems
- Why “Fiat-Shamir for Proofs” Lacks a Proof
- Lossy Codes and a New Variant of the Learning-With-Errors Problem
- Fully homomorphic encryption using ideal lattices
- Constant-round interactive proofs for delegating computation
- Advances in Cryptology - CRYPTO 2003
- On Seed-Incompressible Functions
- On the Generic Insecurity of the Full Domain Hash
- Towards Key-Dependent Message Security in the Standard Model
- The Difference between Consecutive Prime Numbers
- Algorithmic Number Theory
- Noise-tolerant learning, the parity problem, and the statistical query model
- On lattices, learning with errors, random linear codes, and cryptography
