On the Cryptographic Applications of Random Functions (Extended Abstract)
From MaRDI portal
Cited in
(55)- Reducing complexity assumptions for statistically-hiding commitment
- Synthesizers and their application to the parallel construction of pseudo-random functions
- Exploring crypto dark matter: new simple PRF candidates and their applications
- Quantum algorithms for the \(k\)-XOR problem
- Simple and more efficient PRFs with tight security from LWE and matrix-DDH
- On-line ciphers and the Hash-CBC constructions
- On the possibility of basing cryptography on \(\mathsf{EXP}\ne \mathsf{BPP} \)
- MPC-friendly symmetric cryptography from alternating moduli: candidates, protocols, and applications
- Batch-OT with optimal rate
- Authentication in the bounded storage model
- Bounds on the efficiency of black-box commitment schemes
- From non-adaptive to adaptive pseudorandom functions
- Key regression from constrained pseudorandom functions
- Hardness-preserving reductions via cuckoo hashing
- The cost of adaptivity in security games on graphs
- Algebraic partitioning: fully compact and (almost) tightly secure cryptography
- Adaptively secure garbled circuits from one-way functions
- Balancing output length and query bound in hardness preserving constructions of pseudorandom functions
- Error-correcting codes against chosen-codeword attacks
- Towards non-black-box separations of public key encryption and one way function
- Unprovable security of perfect NIZK and non-interactive non-malleable commitments
- The exact PRF security of truncation: tight bounds for keyed sponges and truncated CBC
- Low-complexity cryptographic hash functions
- scientific article; zbMATH DE number 6866298 (Why is no real title available?)
- Pseudorandom functions: three decades later
- Witness maps and applications
- scientific article; zbMATH DE number 7626788 (Why is no real title available?)
- Finding collisions in interactive protocols -- tight lower bounds on the round and communication complexities of statistically hiding commitments
- Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?
- Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?
- Tighter security proofs for GPV-IBE in the quantum random oracle model
- Secure two-party input-size reduction: challenges, solutions and applications
- One-way functions and the hardness of (probabilistic) time-bounded Kolmogorov complexity w.r.t. samplable distributions
- The power of undirected rewindings for adaptive security
- Capturing one-way functions via NP-hardness of meta-complexity
- NP-hardness of approximating meta-complexity: a cryptographic approach
- Succinct computational secret sharing
- Subversion-resilient authenticated encryption without random oracles
- Cryptographic primitives with hinting property
- Counting unpredictable bits: a simple PRG from one-way functions
- On one-way functions and sparse languages
- Lightweight leakage-resilient PRNG from TBCs using superposition
- A direct PRF construction from Kolmogorov complexity
- Fast public-key silent OT and more from constrained Naor-Reingold
- Collision resistance from multi-collision resistance for all constant parameters
- Adaptive security in SNARGs via iO and lossy functions
- A pure indistinguishability obfuscation approach to adaptively-sound SNARGs for NP
- Quantum cryptography and meta-complexity
- On the black-box complexity of correlation intractability
- Securely instantiating `Half Gates' garbling in the standard model
- Lower bounds for Levin-Kolmogorov complexity
- Attribute-based key-insulated signature and its applications
- Simple watermarking pseudorandom functions from extractable pseudorandom generators
- Perpetual encryption
- Performance improvement for the GGM-construction of pseudorandom functions
This page was built for publication: On the Cryptographic Applications of Random Functions (Extended Abstract)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2974488)
