scientific article; zbMATH DE number 861531
From MaRDI portal
Publication:4871218
block cryptosystemone-way functionpseudorandom function generatorpseudorandom generatorssecure digital signature schemessecuritystream private key cryptosystemuniversal one-way hash functionzero-knowledge
Pseudo-random numbers; Monte Carlo methods (11K45) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to information and communication theory (94-01) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60)
Recommendations
Cited in
(73)- Robust random number generation for peer-to-peer systems
- Extractors for binary elliptic curves
- Encryption modes with almost free message integrity
- Modern cryptography, probabilistic proofs and pseudo-randomness
- Reductions in circuit complexity: An isomorphism theorem and a gap theorem
- Synthesizers and their application to the parallel construction of pseudo-random functions
- Zeta functions, one-way functions, and pseudorandom number generators.
- Interactive and probabilistic proof-checking
- Randomness vs time: Derandomization under a uniform assumption
- On the distribution of the Diffie-Hellman pairs
- On the security loss of unique signatures
- The entropy of a distributed computation random number generation from memory interleaving
- Survey on hardware implementation of random number generators on FPGA: theory and experimental analyses
- Guaranteeing the diversity of number generators
- Cryptographic applications of analytic number theory. Complexity lower bounds and pseudo\-randomness
- Dynamic random Weyl sampling for drastic reduction of randomness in Monte Carlo integration
- A reduced order model for a stable embedded boundary parametrized Cahn-Hilliard phase-field system based on cut finite elements
- Pseudo-free families of computational universal algebras
- Cryptographic pseudorandom generators can make cryptosystems problematic
- A visual analysis method of randomness for classifying and ranking pseudo-random number generators
- Pseudo-free families and cryptographic primitives
- Pseudorandom functions from LWE: RKA security and application
- From non-adaptive to adaptive pseudorandom functions
- A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols
- Who are you? Secure identities in single hop ad hoc networks
- On constructing one-way permutations from indistinguishability obfuscation
- Hardness-preserving reductions via cuckoo hashing
- Authenticating ad hoc networks by comparison of short digests
- Lower bounds for non-black-box zero knowledge
- On the adaptive security of MACs and PRFs
- On the uniformity of distribution of the RSA pairs
- scientific article; zbMATH DE number 1583786 (Why is no real title available?)
- Randomness in cryptography
- On constructing one-way permutations from indistinguishability obfuscation
- An efficient pseudo-random generator provably as secure as syndrome decoding
- Another look at tightness
- Balancing output length and query bound in hardness preserving constructions of pseudorandom functions
- The chain rule for HILL pseudoentropy, revisited
- Estimating the range of a function in an online setting
- How to use pseudorandom generators in unconditional security settings
- scientific article; zbMATH DE number 5901698 (Why is no real title available?)
- On security preserving reductions -- revised terminology
- Limits on the power of indistinguishability obfuscation and functional encryption
- Simulating auxiliary inputs, revisited
- A Proof of Security in O(2 n ) for the Benes Scheme
- A primer on pseudorandom generators
- OAEP Is Secure under Key-Dependent Messages
- The Current Status in Design of Efficient Provably Secure Cryptographic Pseudorandom Generators
- Efficiency Bounds for Adversary Constructions in Black-Box Reductions
- scientific article; zbMATH DE number 17389 (Why is no real title available?)
- Foundations of Cryptography
- scientific article; zbMATH DE number 1455093 (Why is no real title available?)
- On characterizations of escrow encryption schemes
- A probabilistic polynomial-time calculus for analysis of cryptographic protocols (preliminary report)
- Random Sources for Cryptographic Systems
- Initiator-resilient universally composable key exchange
- Pseudo-free families of finite computational elementary abelian \(p\)-groups
- Finding collisions in interactive protocols -- tight lower bounds on the round and communication complexities of statistically hiding commitments
- A Bird’s-Eye View of Modern Symmetric Cryptography from Combinatorial Designs
- A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval
- scientific article; zbMATH DE number 4186979 (Why is no real title available?)
- Can PPAD hardness be based on standard cryptographic assumptions?
- Robust numerical integration and pairwise independent random variables
- Building blocks of sharding blockchain systems: concepts, approaches, and open problems
- A note on Yao's theorem about pseudo-random generators
- Pseudorandomness of the Schrödinger map equation
- A direct PRF construction from Kolmogorov complexity
- Current tendencies in free-running oscillators: a review
- Stretching demi-bits and nondeterministic-secure pseudorandomness
- Towards accountability in CRS generation
- Bit-security preserving hardness amplification
- Bit commitment using pseudorandomness
- A note on quadratic residuosity and UP
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 Q4871218)
