scientific article; zbMATH DE number 861531

Publication date: 28 March 1996

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

security pseudorandom generators one-way function zero-knowledge pseudorandom function generator universal one-way hash function block cryptosystem secure digital signature schemes stream private key cryptosystem

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to information and communication theory (94-01) Pseudo-random numbers; Monte Carlo methods (11K45)

Related Items (50)

Dynamic random Weyl sampling for drastic reduction of randomness in Monte Carlo integration ⋮ A visual analysis method of randomness for classifying and ranking pseudo-random number generators ⋮ Another Look at Tightness ⋮ A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols ⋮ A note on quadratic residuosity and UP ⋮ Estimating the range of a function in an online setting ⋮ On the security loss of unique signatures ⋮ Limits on the Power of Indistinguishability Obfuscation and Functional Encryption ⋮ Simulating Auxiliary Inputs, Revisited ⋮ Pseudo-free families and cryptographic primitives ⋮ The entropy of a distributed computation random number generation from memory interleaving ⋮ On characterizations of escrow encryption schemes ⋮ Who are you? Secure identities in single hop ad hoc networks ⋮ Balancing Output Length and Query Bound in Hardness Preserving Constructions of Pseudorandom Functions ⋮ On constructing one-way permutations from indistinguishability obfuscation ⋮ The Chain Rule for HILL Pseudoentropy, Revisited ⋮ Hardness-preserving reductions via cuckoo hashing ⋮ A Proof of Security in O(2 n ) for the Benes Scheme ⋮ Building blocks of sharding blockchain systems: concepts, approaches, and open problems ⋮ On the adaptive security of MACs and PRFs ⋮ Survey on hardware implementation of random number generators on FPGA: theory and experimental analyses ⋮ On the uniformity of distribution of the RSA pairs ⋮ A note on Yao's theorem about pseudo-random generators ⋮ A reduced order model for a stable embedded boundary parametrized Cahn-Hilliard phase-field system based on cut finite elements ⋮ Pseudo-free families of finite computational elementary abelian \(p\)-groups ⋮ A Probabilistic Polynomial-time Calculus For Analysis of Cryptographic Protocols ⋮ Authenticating ad hoc networks by comparison of short digests ⋮ Lower bounds for non-black-box zero knowledge ⋮ OAEP Is Secure under Key-Dependent Messages ⋮ Randomness in Cryptography ⋮ A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval ⋮ Robust numerical integration and pairwise independent random variables ⋮ Pseudo-free families of computational universal algebras ⋮ On Constructing One-Way Permutations from Indistinguishability Obfuscation ⋮ Can PPAD hardness be based on standard cryptographic assumptions? ⋮ Robust random number generation for peer-to-peer systems ⋮ Extractors for binary elliptic curves ⋮ On Security Preserving Reductions – Revised Terminology ⋮ Efficiency Bounds for Adversary Constructions in Black-Box Reductions ⋮ Encryption modes with almost free message integrity ⋮ Reductions in circuit complexity: An isomorphism theorem and a gap theorem ⋮ Synthesizers and their application to the parallel construction of pseudo-random functions ⋮ Interactive and probabilistic proof-checking ⋮ Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments ⋮ Guaranteeing the diversity of number generators ⋮ From non-adaptive to adaptive pseudorandom functions ⋮ A Bird’s-Eye View of Modern Symmetric Cryptography from Combinatorial Designs ⋮ Randomness vs time: Derandomization under a uniform assumption ⋮ On the distribution of the Diffie-Hellman pairs ⋮ Initiator-Resilient Universally Composable Key Exchange

This page was built for publication: