Fiat-Shamir and correlation intractability from strong KDM-secure encryption
type: Item
instance of: scholarly article
title: Fiat-Shamir and correlation intractability from strong KDM-secure encryption
zbMATH Open document ID: 1423.94058
DOI: 10.1007/978-3-319-78381-9_4
author: Ran Canetti
author: Yilei Chen
author: Leonid Reyzin
author: Ron D. Rothblum
publication date: 2018-07-09T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 6900674
MaRDI profile type: Publication
full work available at URL: 978-3-319-78381-9 4
OpenAlex ID: W2795247010
cites work: Q4737261
cites work: Q4228459
cites work: On the concrete hardness of learning with errors
cites work: Key-dependent message security: generic amplification and completeness
cites work: Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
cites work: New Algorithms for Learning in Presence of Errors
cites work: On Lovász' lattice reduction and the nearest lattice point problem
cites work: Bounded Key-Dependent Message Security
cites work: Lower bounds for non-black-box zero knowledge
cites work: Instantiating Random Oracles via UCEs
cites work: Interactive Oracle Proofs
cites work: Why “Fiat-Shamir for Proofs” Lacks a Proof
cites work: Q4413854
cites work: Noise-tolerant learning, the parity problem, and the statistical query model
cites work: Foundations of Non-malleable Hash and One-Way Functions
cites work: Circular-Secure Encryption from Decision Diffie-Hellman
cites work: Circular and Leakage Resilient Public-Key Encryption under Subgroup Indistinguishability
cites work: Black-Box Circular-Secure Encryption beyond Affine Functions
cites work: Q2778843
cites work: Q4364570
cites work: On the Correlation Intractability of Obfuscated Pseudorandom Functions
cites work: Q4542539
cites work: The random oracle methodology, revisited
cites work: On Symmetric Encryption and Point Obfuscation
cites work: Q4542530
cites work: Discrete logarithms in \(\mathrm{GF}(p)\)
cites work: On the discrete logarithm problem in elliptic curves
cites work: On the Generic Insecurity of the Full Domain Hash
cites work: Randomness Condensers for Efficiently Samplable, Seed-Dependent Sources
cites work: Lossy Codes and a New Variant of the Learning-With-Errors Problem
cites work: Q4318690
cites work: Magic Functions
cites work: A public key cryptosystem and a signature scheme based on discrete logarithms
cites work: Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
cites work: How To Prove Yourself: Practical Solutions to Identification and Signature Problems
cites work: Recent progress on the elliptic curve discrete logarithm problem
cites work: Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem
cites work: Constructive and destructive facets of Weil descent on elliptic curves
cites work: Fully homomorphic encryption using ideal lattices
cites work: Probabilistic encryption
cites work: The knowledge complexity of interactive proof-systems
cites work: Correlated-Input Secure Hash Functions
cites work: Q3615925
cites work: On the (Im)Possibility of Key Dependent Encryption
cites work: On Seed-Incompressible Functions
cites work: A Pseudorandom Generator from any One-way Function
cites work: On the asymptotic complexity of solving LWE
cites work: Towards Key-Dependent Message Security in the Standard Model
cites work: Advances in Cryptology - CRYPTO 2003
cites work: Probabilistically Checkable Arguments
cites work: From obfuscation to the security of Fiat-Shamir for proofs
cites work: An Improved BKW Algorithm for LWE with Applications to Cryptography and Lattices
cites work: Factoring polynomials with rational coefficients
cites work: Better Key Sizes (and Attacks) for LWE-Based Encryption
cites work: Reducing elliptic curve logarithms to logarithms in a finite field
cites work: Hardness of SIS and LWE with Small Parameters
cites work: Lattice-based Cryptography
cites work: Algorithmic Number Theory
cites work: Q4409113
cites work: Algebraic Approaches for the Elliptic Curve Discrete Logarithm Problem over Prime Fields
cites work: A monte carlo method for factorization
cites work: The Difference between Consecutive Prime Numbers
cites work: On lattices, learning with errors, random linear codes, and cryptography
cites work: Constant-round interactive proofs for delegating computation
cites work: A hierarchy of polynomial time lattice basis reduction algorithms

Fiat-Shamir and correlation intractability from strong KDM-secure encryption (cites work)
cites work: Fiat-Shamir and correlation intractability from strong KDM-secure encryption

Fiat-Shamir and correlation intractability from strong KDM-secure encryption (cites work)
cites work: The Magic of ELFs