Pages that link to "Item:Q4268715"
From MaRDI portal
The following pages link to A Pseudorandom Generator from any One-way Function (Q4268715):
Displaying 50 items.
- Quantum commitments from complexity assumptions (Q260394) (← links)
- Concurrent knowledge extraction in public-key models (Q271592) (← links)
- An optimally fair coin toss (Q315542) (← links)
- Leakage-resilient cryptography from minimal assumptions (Q315546) (← links)
- Garbling XOR gates ``for free'' in the standard model (Q315547) (← links)
- A counterexample to the chain rule for conditional HILL entropy (Q332268) (← links)
- Unprovable security of perfect NIZK and non-interactive non-malleable commitments (Q332270) (← links)
- A thirty year old conjecture about promise problems (Q347124) (← links)
- Programmable hash functions and their applications (Q434345) (← links)
- A framework for non-interactive instance-dependent commitment schemes (NIC) (Q500985) (← links)
- When can limited randomness be used in repeated games? (Q506541) (← links)
- Efficient one-sided adaptively secure computation (Q514477) (← links)
- Generating shorter bases for hard random lattices (Q537918) (← links)
- The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory (Q619899) (← links)
- On optimal heuristic randomized semidecision procedures, with applications to proof complexity and cryptography (Q693058) (← links)
- Avoiding simplicity is complex (Q693072) (← links)
- Sharp lower bounds on the extractable randomness from non-uniform sources (Q719242) (← links)
- QUAD: A multivariate stream cipher with provable security (Q733512) (← links)
- Comparing notions of computational entropy (Q733747) (← links)
- On linear-size pseudorandom generators and hardcore functions (Q744085) (← links)
- Cryptography in the multi-string model (Q744350) (← links)
- Verifiable random functions: relations to identity-based key encapsulation and new constructions (Q744351) (← links)
- Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs (Q901372) (← links)
- Quantum cryptography (Q975385) (← links)
- A note on universal composable zero-knowledge in the common reference string model (Q1007253) (← links)
- Handling expected polynomial-time strategies in simulation-based security proofs (Q1021232) (← links)
- Reducing complexity assumptions for statistically-hiding commitment (Q1027978) (← links)
- Upper and lower bounds on black-box steganography (Q1027982) (← links)
- Cryptography with constant input locality (Q1037233) (← links)
- Characterizing the existence of one-way permutations (Q1575721) (← links)
- Randomness vs time: Derandomization under a uniform assumption (Q1604214) (← links)
- Cutting-edge cryptography through the lens of secret sharing (Q1627968) (← links)
- Provable time-memory trade-offs: symmetric cryptography against memory-bounded adversaries (Q1629393) (← links)
- Perfect secure computation in two rounds (Q1629404) (← links)
- Adaptively secure distributed PRFs from LWE (Q1631339) (← links)
- Exploring crypto dark matter: new simple PRF candidates and their applications (Q1631360) (← links)
- Super-strong RKA secure MAC, PKE and SE from tag-based hash proof system (Q1647557) (← links)
- On the bit security of cryptographic primitives (Q1648779) (← links)
- Fiat-Shamir and correlation intractability from strong KDM-secure encryption (Q1648782) (← links)
- Encoding invariance in average case complexity (Q1678756) (← links)
- Quantum one-way permutation over the finite field of two elements (Q1679363) (← links)
- On the impossibility of cryptography with tamperable randomness (Q1688399) (← links)
- The hunting of the SNARK (Q1698394) (← links)
- Round-efficient black-box construction of composable multi-party computation (Q1715857) (← links)
- On the security of the WOTS-PRF signature scheme (Q1726024) (← links)
- Incremental deterministic public-key encryption (Q1747660) (← links)
- Practical witness encryption for algebraic languages or how to encrypt under Groth-Sahai proofs (Q1791668) (← links)
- Secure two-party computation via cut-and-choose oblivious transfer (Q1928765) (← links)
- Public-coin parallel zero-knowledge for NP (Q1946592) (← links)
- Fourier concentration from shrinkage (Q2012185) (← links)
