Fiat-Shamir and correlation intractability from strong KDM-secure encryption (Q1648782)

From MaRDI portal

Revision as of 02:51, 16 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Fiat-Shamir and correlation intractability from strong KDM-secure encryption	scientific article

Statements

scholarly article

0 references

Fiat-Shamir and correlation intractability from strong KDM-secure encryption (English)

0 references

zbMATH Open document ID

0 references

10.1007/978-3-319-78381-9_4

0 references

0 references

0 references

0 references

Ron D. Rothblum

0 references

publication date

9 July 2018

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-319-78381-9_4

0 references

0 references

0 references

0 references

On the concrete hardness of learning with errors

0 references

Key-dependent message security: generic amplification and completeness

0 references

Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems

0 references

New Algorithms for Learning in Presence of Errors

0 references

On Lovász' lattice reduction and the nearest lattice point problem

0 references

Bounded Key-Dependent Message Security

0 references

Lower bounds for non-black-box zero knowledge

0 references

Instantiating Random Oracles via UCEs

0 references

Interactive Oracle Proofs

0 references

Why “Fiat-Shamir for Proofs” Lacks a Proof

0 references

0 references

Noise-tolerant learning, the parity problem, and the statistical query model

0 references

Foundations of Non-malleable Hash and One-Way Functions

0 references

Circular-Secure Encryption from Decision Diffie-Hellman

0 references

Circular and Leakage Resilient Public-Key Encryption under Subgroup Indistinguishability

0 references

Black-Box Circular-Secure Encryption beyond Affine Functions

0 references

0 references

0 references

On the Correlation Intractability of Obfuscated Pseudorandom Functions

0 references

Fiat-Shamir and correlation intractability from strong KDM-secure encryption

0 references

0 references

The random oracle methodology, revisited

0 references

On Symmetric Encryption and Point Obfuscation

0 references

0 references

Discrete logarithms in \(\mathrm{GF}(p)\)

0 references

On the discrete logarithm problem in elliptic curves

0 references

On the Generic Insecurity of the Full Domain Hash

0 references

Randomness Condensers for Efficiently Samplable, Seed-Dependent Sources

0 references

Lossy Codes and a New Variant of the Learning-With-Errors Problem

0 references

0 references

Magic Functions

0 references

A public key cryptosystem and a signature scheme based on discrete logarithms

0 references

Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions

0 references

How To Prove Yourself: Practical Solutions to Identification and Signature Problems

0 references

Recent progress on the elliptic curve discrete logarithm problem

0 references

Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem

0 references

Constructive and destructive facets of Weil descent on elliptic curves

0 references

Fully homomorphic encryption using ideal lattices

0 references

Probabilistic encryption

0 references

The knowledge complexity of interactive proof-systems

0 references

Correlated-Input Secure Hash Functions

0 references

0 references

On the (Im)Possibility of Key Dependent Encryption

0 references

On Seed-Incompressible Functions

0 references

A Pseudorandom Generator from any One-way Function

0 references

On the asymptotic complexity of solving LWE

0 references

Towards Key-Dependent Message Security in the Standard Model

0 references

Advances in Cryptology - CRYPTO 2003

0 references

Probabilistically Checkable Arguments

0 references

From obfuscation to the security of Fiat-Shamir for proofs

0 references

An Improved BKW Algorithm for LWE with Applications to Cryptography and Lattices

0 references

Factoring polynomials with rational coefficients

0 references

Better Key Sizes (and Attacks) for LWE-Based Encryption

0 references

Reducing elliptic curve logarithms to logarithms in a finite field

0 references

Hardness of SIS and LWE with Small Parameters

0 references

Lattice-based Cryptography

0 references

Algorithmic Number Theory

0 references

0 references

Algebraic Approaches for the Elliptic Curve Discrete Logarithm Problem over Prime Fields

0 references

A monte carlo method for factorization

0 references

The Difference between Consecutive Prime Numbers

0 references

On lattices, learning with errors, random linear codes, and cryptography

0 references

Constant-round interactive proofs for delegating computation

0 references

A hierarchy of polynomial time lattice basis reduction algorithms

0 references

The Magic of ELFs

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1648782

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1648782&oldid=36406936"