scientific article; zbMATH DE number 3960854

Random number generation in numerical analysis (65C10) Analysis of algorithms and problem complexity (68Q25) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

A Pseudorandom Generator from any One-way Function
Hardness vs randomness
One way functions and pseudorandom generators
Publication:3471244
On the Existence of Pseudorandom Generators

Cited in

(only showing first 100 items - show all)

Prediction-preserving reducibility
QUAD: A Practical Stream Cipher with Provable Security
Quantum algorithms for the $k$-XOR problem
Adaptively secure distributed PRFs from $\mathsf{LWE}$
A Leakage-Resilient Mode of Operation
Leakage resilience from program obfuscation
Monkey: black-box symmetric ciphers designed for MON\textit{opolizing} KEY\textit{s}
Bandwidth-efficient attribute-based key-insulated signatures with message recovery
On related-secret pseudorandomness
On the security of the WOTS-PRF signature scheme
Matrix PRFs: constructions, attacks, and applications to obfuscation
Guaranteeing the diversity of number generators
On the universal steganography of optimal rate
Tightly CCA-secure identity-based encryption with ciphertext pseudorandomness
Chosen-ciphertext secure multi-hop identity-based conditional proxy re-encryption with constant-size ciphertexts
On the Security Loss in Cryptographic Reductions
mrNISC from LWE with polynomial modulus
New proofs for NMAC and HMAC: security without collision resistance
Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE
A Provable-Security Treatment of the Key-Wrap Problem
The learnability of quantum states
Computational indistinguishability: A sample hierarchy
Computational Security of Quantum Encryption
The Layered Games Framework for Specifications and Analysis of Security Protocols
Block encryption of quantum messages
Computational hardness of optimal fair computation: beyond Minicrypt
Non-Black-Box Worst-Case to Average-Case Reductions Within $\mathsf{NP}$
When messages are keys: is HMAC a dual-PRF?
Upper and lower bounds on black-box steganography
Efficient computations over encrypted data blocks
Kernels as features: on kernels, margins, and low-dimensional mappings
Homomorphic evaluation requires depth
Hidden cosets and applications to unclonable cryptography
Bit commitment using pseudorandomness
Noise-free thumbnail-preserving image encryption based on MSB prediction
Obfuscation for cryptographic purposes
Resource-aware protocols for authenticated group key exchange in integrated wired and wireless networks
Checking the correctness of memories
On the exact round complexity of secure three-party computation
Near-optimal private information retrieval with preprocessing
Computing on authenticated data
From non-adaptive to adaptive pseudorandom functions
On learning a union of half spaces
A simple construction of iO for Turing machines
FE and iO for Turing machines from minimal assumptions
Building blocks of sharding blockchain systems: concepts, approaches, and open problems
Exploring crypto dark matter: new simple PRF candidates and their applications
Watermarking PRFs under standard assumptions: public marking and security with extraction queries
Randomness and computation
Session resumption protocols and efficient forward security for TLS 1.3 0-RTT
A study of password security
Improved proxy re-encryption schemes with applications to secure distributed storage
Limits on the efficiency of (ring) LWE-based non-interactive key exchange
MoSS: modular security specifications framework
Minicrypt primitives with algebraic structure and applications
Provably-secure time-bound hierarchical key assignment schemes
Multi-input functional encryption in the private-key setting: stronger security from weaker assumptions
A proof of security of Yao's protocol for two-party computation
An epistemic foundation for authentication logics (extended abstract)
QUAD: A multivariate stream cipher with provable security
Performance improvement for the GGM-construction of pseudorandom functions
Correlated pseudorandomness from expand-accumulate codes
McCulloch-Pitts brains and pseudorandom functions
A construction of the simplest super pseudorandom permutation generator
Key-homomorphic pseudorandom functions from LWE with small modulus
The round complexity of quantum zero-knowledge
Watermarking cryptographic functionalities from standard lattice assumptions
Bi-homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption
Output-compressing randomized encodings and applications
Perfect structure on the edge of chaos. Trapdoor permutations from indistinguishability obfuscation
Watermarking cryptographic capabilities
Limits on the power of indistinguishability obfuscation and functional encryption
Fast pseudorandom functions based on expander graphs
Single-key to multi-key functional encryption with polynomial loss
Breaking the sub-exponential barrier in obfustopia
Constraining pseudorandom functions privately
From Minicrypt to Obfustopia via private-key functional encryption
Private puncturable PRFs from standard lattice assumptions
Programmable distributed point functions
Efficient oblivious evaluation protocol and conditional disclosure of secrets for DFA
Luby-Rackoff Ciphers from Weak Round Functions?
From cryptomania to obfustopia through secret-key functional encryption
From minicrypt to obfustopia via private-key functional encryption
Revocable hierarchical identity-based encryption with adaptive security
\textsf{ISAP+}: \textsf{ISAP} with fast authentication
Universal reductions: reductions relative to stateful oracles
No-directional and backward-leak uni-directional updatable encryption are equivalent
Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation
On symmetric encryption with distinguishable decryption failures
On the correlation intractability of obfuscated pseudorandom functions
Cryptography and cryptographic protocols
Puncturable pseudorandom sets and private information retrieval with near-optimal online bandwidth and time
Targeted lossy functions and applications
The security of the cipher block chaining message authentication code
Error-correcting codes against chosen-codeword attacks
Verifiable random functions from non-interactive witness-indistinguishable proofs
Long-term security and universal composability
Leakage-resilient cryptography from minimal assumptions
Mathematical problems in cryptology
On nonadaptive reductions to the set of random strings and its dense subsets

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3729902)