Random oracles and non-uniformity
type: Item
instance of: scholarly article
title: Random oracles and non-uniformity
zbMATH Open document ID: 1423.94063
DOI: 10.1007/978-3-319-78381-9_9
author: Sandro Coretti
author: Yevgeniy Dodis
author: Siyao Guo
author: John P. Steinberger
publication date: 2018-07-09T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 6900679
MaRDI profile type: Publication
full work available at URL: 978-3-319-78381-9 9
OpenAlex ID: W2794798416
cites work: Q4737261
cites work: Simple Constructions of Almost k-wise Independent Random Variables
cites work: Everlasting security in the bounded storage model
cites work: Advances in Cryptology - EUROCRYPT 2004
cites work: Q4365732
cites work: Non-uniform Cracks in the Concrete: The Power of Free Precomputation
cites work: Theory of Cryptography
cites work: The random oracle methodology, revisited
cites work: On the power of nonuniformity in proofs of security
cites work: Q3212279
cites work: Time Space Tradeoffs for Attacks against One-Way Functions and PRGs
cites work: Fixing Cracks in the Concrete: Random Oracles with Auxiliary Input, Revisited
cites work: Key Derivation without Entropy Waste
cites work: Message Authentication Codes from Unpredictable Block Ciphers
cites work: Tight security proofs for the bounded-storage model
cites work: Rigorous Time/Space Trade-offs for Inverting Functions
cites work: How To Prove Yourself: Practical Solutions to Identification and Signature Problems
cites work: Bounds on the Efficiency of Generic Cryptographic Constructions
cites work: A uniform-complexity treatment of encryption and zero-knowledge
cites work: On the Composition of Zero-Knowledge Proof Systems
cites work: Definitions and properties of zero-knowledge proof systems
cites work: Rectangles are nonnegative juntas
cites work: A cryptanalytic time-memory trade-off
cites work: Key-Alternating Ciphers and Key-Length Extension: Exact Bounds and Multi-user Security
cites work: Q4549233
cites work: Pseudorandomness for network algorithms
cites work: Q4526985
cites work: Q3152808
cites work: Q3191615
cites work: Approximating rectangles by juntas and weakly-exponential lower bounds for LP relaxations of CSPs
cites work: On the Power of Hierarchical Identity-Based Encryption
cites work: Conditionally-perfect secrecy and a provably-secure randomized cipher
cites work: Q4409113
cites work: Advances in Cryptology - CRYPTO 2003
cites work: The “Coefficients H” Technique
cites work: Formalizing Human Ignorance
cites work: Q3210171
cites work: Security Amplification for the Cascade of Arbitrarily Weak PRPs: Tight Bounds via the Interactive Hardcore Lemma
cites work: Random Oracles and Auxiliary Input
cites work: Constructing locally computable extractors and cryptosystems in the bounded-storage model
description: scientific article; zbMATH DE number 6900679