On the public citation graph

How to Generate Cryptographically Strong Sequences of Pseudorandom Bits

https://doi.org/10.1137/0213053
0 signed · 1139 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-08860-1_6openalex-snapshot
Relationship between density and deterministic complexity of MP-complete languages
inferredcites →https://doi.org/10.1007/3-540-10843-2_43openalex-snapshot
On the generation of cryptographically strong pseudo-random sequences
inferredcites →https://doi.org/10.1007/978-1-4684-2001-2_9openalex-snapshot
Reducibility among Combinatorial Problems
inferredcites →https://doi.org/10.1016/0022-0000(84)90070-9openalex-snapshot
Probabilistic encryption
inferredcites →https://doi.org/10.1016/s0022-0000(76)80043-8openalex-snapshot
Riemann's hypothesis and tests for primality
inferredcites →https://doi.org/10.1090/s0025-5718-1970-0276200-xopenalex-snapshot
Factoring polynomials over large finite fields
inferredcites →https://doi.org/10.1109/sfcs.1980.40openalex-snapshot
Sparse complete sets for NP: Solution of a conjecture of Berman and Hartmanis
inferredcites →https://doi.org/10.1109/sfcs.1982.100openalex-snapshot
Why and how to establish a private code on a public network
inferredcites →https://doi.org/10.1109/sfcs.1982.45openalex-snapshot
Theory and application of trapdoor functions
inferredcites →https://doi.org/10.1109/sfcs.1982.72openalex-snapshot
How to generate cryptographically strong sequences of pseudo random bits
inferredcites →https://doi.org/10.1109/sfcs.1982.73openalex-snapshot
Inferring a sequence generated by a linear congruence
inferredcites →https://doi.org/10.1109/tit.1978.1055817openalex-snapshot
An improved algorithm for computing logarithms overGF(p)and its cryptographic significance (Corresp.)
inferredcites →https://doi.org/10.1137/0206006openalex-snapshot
A Fast Monte-Carlo Test for Primality
inferredcites →https://doi.org/10.1137/0208034openalex-snapshot
A Note on Sparse Complete Sets
inferredcites →https://doi.org/10.1145/359340.359342openalex-snapshot
A method for obtaining digital signatures and public-key cryptosystems
inferredcites →https://doi.org/10.1215/ijm/1255631807openalex-snapshot
Approximate formulas for some functions of prime numbers
inferredcites →https://doi.org/10.2307/2312370openalex-snapshot
Solved and Unsolved Problems in Number Theory.

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.1157394openalex-extracted
Reducing Complexity Assumptions for Statistically-Hiding Commitment*
inferred← citeshttps://doi.org/10.1002/0471667196.ess2174openalex-snapshot
Randomness and Probability—Complexity of Description
inferred← citeshttps://doi.org/10.1002/0471667196.ess2174.pub2openalex-snapshot
Complexity
inferred← citeshttps://doi.org/10.1002/9781118445112.stat02992openalex-snapshot
Complexity
inferred← citeshttps://doi.org/10.1002/9781119183471.refsopenalex-snapshot
References
inferred← citeshttps://doi.org/10.1002/rsa.10083openalex-snapshot
Deterministic approximation of the cover time
inferred← citeshttps://doi.org/10.1002/rsa.3240030206openalex-snapshot
Sparse pseudorandom distributions
inferred← citeshttps://doi.org/10.1002/scj.4690220204openalex-snapshot
Note on the efficiency of methods to generate quasi‐random sequences
inferred← citeshttps://doi.org/10.1002/scj.4690250903openalex-snapshot
Construction of pseudorandom permutations
inferred← citeshttps://doi.org/10.1002/sec.571openalex-snapshot
Efficient chosen ciphertext secure public‐key encryption under factoring assumption
inferred← citeshttps://doi.org/10.1006/jagm.1998.0952openalex-snapshot
Design of Practical and Provably Good Random Number Generators
inferred← citeshttps://doi.org/10.1006/jcss.1997.1494openalex-snapshot
Natural Proofs
inferred← citeshttps://doi.org/10.1006/jcss.1998.1618openalex-snapshot
Synthesizers and Their Application to the Parallel Construction of Pseudo-Random Functions
inferred← citeshttps://doi.org/10.1006/jcss.1999.1666openalex-snapshot
Computational Sample Complexity and Attribute-Efficient Learning
inferred← citeshttps://doi.org/10.1006/jcss.1999.1689openalex-snapshot
Protecting Data Privacy in Private Information Retrieval Schemes
inferred← citeshttps://doi.org/10.1006/jcss.1999.1695openalex-snapshot
Improved Algorithms via Approximations of Probability Distributions
inferred← citeshttps://doi.org/10.1006/jcss.2000.1730openalex-snapshot
Pseudorandom Generators without the XOR Lemma
inferred← citeshttps://doi.org/10.1006/jcss.2001.1780openalex-snapshot
Randomness vs Time: Derandomization under a Uniform Assumption
inferred← citeshttps://doi.org/10.1006/jnth.1994.1084openalex-snapshot
Several Generalizations of Weil Sums
inferred← citeshttps://doi.org/10.1007/0-387-23483-7_37openalex-snapshot
Blum–Blum–Shub Pseudorandom Bit Generator
inferred← citeshttps://doi.org/10.1007/0-387-34799-2_12openalex-snapshot
On the Existence of Pseudorandom Generators
inferred← citeshttps://doi.org/10.1007/0-387-34799-2_13openalex-snapshot
On The Randomness of Legendre and Jacobi Sequences
inferred← citeshttps://doi.org/10.1007/0-387-34799-2_14openalex-snapshot
Efficient, Perfect Random Number Generators
inferred← citeshttps://doi.org/10.1007/0-387-34799-2_15openalex-snapshot
How To Sign Given Any Trapdoor Function
inferred← citeshttps://doi.org/10.1007/0-387-34799-2_2openalex-snapshot
Limits on the Provable Consequences of One-way Permutations
inferred← citeshttps://doi.org/10.1007/0-387-34799-2_20openalex-snapshot
Proving Security Against Chosen Ciphertext Attacks
inferred← citeshttps://doi.org/10.1007/0-387-34799-2_21openalex-snapshot
Non-Interactive Zero-Knowledge with Preprocessing
inferred← citeshttps://doi.org/10.1007/0-387-34799-2_23openalex-snapshot
On Generating Solved Instances of Computational Problems
inferred← citeshttps://doi.org/10.1007/0-387-34799-2_5openalex-snapshot
A Perfect Zero-Knowledge Proof for a Problem Equivalent to Discrete Logarithm
inferred← citeshttps://doi.org/10.1007/0-387-34805-0_11openalex-snapshot
Perfect Local Randomness in Pseudo-random Sequences
inferred← citeshttps://doi.org/10.1007/0-387-34805-0_12openalex-snapshot
Sparse Pseudorandom Distributions
inferred← citeshttps://doi.org/10.1007/0-387-34805-0_13openalex-snapshot
Bit Commitment Using Pseudo-Randomness
inferred← citeshttps://doi.org/10.1007/0-387-34805-0_14openalex-snapshot
How to Predict Congruential Generators
inferred← citeshttps://doi.org/10.1007/0-387-34805-0_17openalex-snapshot
Batch RSA
inferred← citeshttps://doi.org/10.1007/0-387-34805-0_42openalex-snapshot
On the Construction of Block Ciphers Provably Secure and Not Relying on Any Unproved Hypotheses
inferred← citeshttps://doi.org/10.1007/0-387-34805-0_48openalex-snapshot
Non-Interactive Oblivious Transfer and Applications
inferred← citeshttps://doi.org/10.1007/0-387-34805-0_50openalex-snapshot
Controlled Gradual Disclosure Schemes for Random Bits and Their Applications
inferred← citeshttps://doi.org/10.1007/1-4020-8070-0_10openalex-snapshot
Anti-Tamper Databases
inferred← citeshttps://doi.org/10.1007/11426639_16openalex-snapshot
Computational Indistinguishability Between Quantum States and Its Cryptographic Application
inferred← citeshttps://doi.org/10.1007/11426639_4openalex-snapshot
Reducing Complexity Assumptions for Statistically-Hiding Commitment
inferred← citeshttps://doi.org/10.1007/11523468_10openalex-snapshot
Simple Extractors via Constructions of Cryptographic Pseudo-random Generators
inferred← citeshttps://doi.org/10.1007/11523468_11openalex-snapshot
Bounds on the Efficiency of “Black-Box” Commitment Schemes
inferred← citeshttps://doi.org/10.1007/11535218_25openalex-snapshot
Analysis of Random Oracle Instantiation Scenarios for OAEP and Other Practical Schemes
inferred← citeshttps://doi.org/10.1007/11538462_39openalex-snapshot
Reconstructive Dispersers and Hitting Set Generators
inferred← citeshttps://doi.org/10.1007/11550822_34openalex-snapshot
Can Dynamic Neural Filters Produce Pseudo-Random Sequences?
inferred← citeshttps://doi.org/10.1007/11590156_2openalex-snapshot
Computational Complexity Since 1980
inferred← citeshttps://doi.org/10.1007/11590156_6openalex-snapshot
Proving Lower Bounds Via Pseudo-random Generators
inferred← citeshttps://doi.org/10.1007/11681878_20openalex-snapshot
Universally Composable Symbolic Analysis of Mutual Authentication and Key-Exchange Protocols
inferred← citeshttps://doi.org/10.1007/11681878_23openalex-snapshot
Pseudorandom Generators from One-Way Functions: A Simple Construction for Any Hardness
inferred← citeshttps://doi.org/10.1007/11683858_7openalex-snapshot
Quantum Computational Cryptography
inferred← citeshttps://doi.org/10.1007/11689522_19openalex-snapshot
Identity-Based Key Agreement with Unilateral Identity Privacy Using Pairings
inferred← citeshttps://doi.org/10.1007/11745853_10openalex-snapshot
Collision-Resistant No More: Hash-and-Sign Paradigm Revisited
inferred← citeshttps://doi.org/10.1007/11761679_8openalex-snapshot
QUAD: A Practical Stream Cipher with Provable Security
inferred← citeshttps://doi.org/10.1007/11787006_19openalex-snapshot
Quantum Hardcore Functions by Complexity-Theoretical Quantum List Decoding
inferred← citeshttps://doi.org/10.1007/11799313_26openalex-snapshot
Distinguishing Attacks on the Stream Cipher Py
inferred← citeshttps://doi.org/10.1007/11801412_14openalex-snapshot
Cryptanalysis of the Energy Efficient Stream Ciphers SSC2
inferred← citeshttps://doi.org/10.1007/11830924_25openalex-snapshot
On Pseudorandom Generators with Linear Stretch in NC0
inferred← citeshttps://doi.org/10.1007/11889342_19openalex-snapshot
On Pseudorandom Sequences and Their Application
inferred← citeshttps://doi.org/10.1007/11935230_13openalex-snapshot
On the Provable Security of an Efficient RSA-Based Pseudorandom Generator
inferred← citeshttps://doi.org/10.1007/11935230_14openalex-snapshot
On the Security of OAEP
inferred← citeshttps://doi.org/10.1007/11941378_12openalex-snapshot
Another Look at “Provable Security”. II
inferred← citeshttps://doi.org/10.1007/11944836_19openalex-snapshot
Some Results on Average-Case Hardness Within the Polynomial Hierarchy
inferred← citeshttps://doi.org/10.1007/3-540-16486-3_108openalex-snapshot
Expanders, randomness, or time versus space
inferred← citeshttps://doi.org/10.1007/3-540-16486-3_89openalex-snapshot
One-way functions and circuit complexity
inferred← citeshttps://doi.org/10.1007/3-540-32743-6_8openalex-snapshot
Von der Turingmaschine zum Quantencomputer — ein Gang durch die Geschichte der Komplexitätstheorie
inferred← citeshttps://doi.org/10.1007/3-540-36178-2_19openalex-snapshot
The Hardness of Hensel Lifting: The Case of RSA and Discrete Logarithm
inferred← citeshttps://doi.org/10.1007/3-540-36178-2_24openalex-snapshot
The Provable Security of Graph-Based One-Time Signatures and Extensions to Algebraic Signature Schemes
inferred← citeshttps://doi.org/10.1007/3-540-36288-6_7openalex-snapshot
Randomness Re-use in Multi-recipient Encryption Schemeas
inferred← citeshttps://doi.org/10.1007/3-540-36383-1_10openalex-snapshot
Distributed Algorithm Engineering
inferred← citeshttps://doi.org/10.1007/3-540-36400-5_31openalex-snapshot
Evaluation Criteria for True (Physical) Random Number Generators Used in Cryptographic Applications
inferred← citeshttps://doi.org/10.1007/3-540-36413-7_7openalex-snapshot
An Improved Pseudorandom Generator Based on Hardness of Factoring
inferred← citeshttps://doi.org/10.1007/3-540-36563-x_1openalex-snapshot
Forward-Security in Private-Key Cryptography
inferred← citeshttps://doi.org/10.1007/3-540-36563-x_2openalex-snapshot
Intrusion-Resilient Public-Key Encryption
inferred← citeshttps://doi.org/10.1007/3-540-37437-x_11openalex-snapshot
Probabilistische Algorithmen
inferred← citeshttps://doi.org/10.1007/3-540-38424-3_32openalex-snapshot
How to Time-Stamp a Digital Document
inferred← citeshttps://doi.org/10.1007/3-540-38424-3_7openalex-snapshot
One-Way Group Actions
inferred← citeshttps://doi.org/10.1007/3-540-39118-5_19openalex-snapshot
Collision Free Hash Functions and Public Key Signature Schemes
inferred← citeshttps://doi.org/10.1007/3-540-39200-9_12openalex-snapshot
Nearly One-Sided Tests and the Goldreich-Levin Predicate
inferred← citeshttps://doi.org/10.1007/3-540-39568-7_22openalex-snapshot
On the Cryptographic Applications of Random Functions (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/3-540-39568-7_24openalex-snapshot
RSA/Rabin least significant bits are $$ \tfrac{1} {2} + \tfrac{1} {{poly \left( {\log N} \right)}} $$ secure (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/3-540-39757-4_20openalex-snapshot
Discrete logarithms in finite fields and their cryptographic significance
inferred← citeshttps://doi.org/10.1007/3-540-39799-x_33openalex-snapshot
Efficient Parallel Pseudo-Random Number Generation
inferred← citeshttps://doi.org/10.1007/3-540-39799-x_35openalex-snapshot
The Bit Security of Modular Squaring given Partial Factorization of the Modulos
inferred← citeshttps://doi.org/10.1007/3-540-39799-x_43openalex-snapshot
The Importance of Good Key Scheduling Schemes (how To Make a Secure Des Scheme With Less-than-or-equal-to-48 Bit Keys)
inferred← citeshttps://doi.org/10.1007/3-540-39805-8_18openalex-snapshot
Using Algorithms as Keys in Stream Ciphers
inferred← citeshttps://doi.org/10.1007/3-540-39805-8_8openalex-snapshot
Simultaneous Security of Bits in the Discrete Log
inferred← citeshttps://doi.org/10.1007/3-540-40996-3_26openalex-snapshot
Derandomizing Arthur-Merlin Games under Uniform Assumptions
inferred← citeshttps://doi.org/10.1007/3-540-44448-3_42openalex-snapshot
Increasing the Lifetime of a Key: A Comparative Analysis of the Security of Re-keying Techniques
inferred← citeshttps://doi.org/10.1007/3-540-44577-3_5openalex-snapshot
Cryptography 2000±10
inferred← citeshttps://doi.org/10.1007/3-540-44586-2_7openalex-snapshot
A New Aspect for Security Notions: Secure Randomness in Public-Key Encryption Schemes
inferred← citeshttps://doi.org/10.1007/3-540-44598-6_29openalex-snapshot
An Improved Pseudo-random Generator Based on Discrete Log
inferred← citeshttps://doi.org/10.1007/3-540-44647-8_2openalex-snapshot
Universally Composable Commitments
inferred← citeshttps://doi.org/10.1007/3-540-44647-8_24openalex-snapshot
Session-Key Generation Using Human Passwords Only
inferred← citeshttps://doi.org/10.1007/3-540-44647-8_29openalex-snapshot
Pseudorandomness from Braid Groups
inferred← citeshttps://doi.org/10.1007/3-540-44683-4_24openalex-snapshot
On Pseudorandom Generators in NC0
inferred← citeshttps://doi.org/10.1007/3-540-44709-1_9openalex-snapshot
Pseudo-random Number Generation on the IBM 4758 Secure Crypto Coprocessor
inferred← citeshttps://doi.org/10.1007/3-540-44750-4_27openalex-snapshot
Proactive Secret Sharing Or: How to Cope With Perpetual Leakage
inferred← citeshttps://doi.org/10.1007/3-540-44750-4_7openalex-snapshot
Efficient Commitment Schemes with Bounded Sender and Unbounded Receiver
inferred← citeshttps://doi.org/10.1007/3-540-44929-9_3openalex-snapshot
List Decoding: Algorithms and Applications
inferred← citeshttps://doi.org/10.1007/3-540-44987-6_15openalex-snapshot
The Bit Security of Paillier’s Encryption Scheme and Its Applications
inferred← citeshttps://doi.org/10.1007/3-540-44987-6_16openalex-snapshot
Assumptions Related to Discrete Logarithms: Why Subtleties Make a Real Difference
inferred← citeshttps://doi.org/10.1007/3-540-45022-x_38openalex-snapshot
Necessary and Sufficient Assumptions for Non-interactive Zero-Knowledge Proofs of Knowledge for All NP Relations
inferred← citeshttps://doi.org/10.1007/3-540-45022-x_58openalex-snapshot
Pseudorandomness
inferred← citeshttps://doi.org/10.1007/3-540-45294-x_6openalex-snapshot
Hard Sets and Pseudo-random Generators for Constant Depth Circuits
inferred← citeshttps://doi.org/10.1007/3-540-45455-1_32openalex-snapshot
Fixed Points and Two-Cycles of the Discrete Logarithm
inferred← citeshttps://doi.org/10.1007/3-540-45664-3_3openalex-snapshot
On Sufficient Randomness for Secure Public-Key Cryptosystems
inferred← citeshttps://doi.org/10.1007/3-540-45682-1_23openalex-snapshot
Mutually Independent Commitments
inferred← citeshttps://doi.org/10.1007/3-540-45682-1_26openalex-snapshot
Practical Construction and Analysis of Pseudo-Randomness Primitives
inferred← citeshttps://doi.org/10.1007/3-540-45682-1_3openalex-snapshot
The Modular Inversion Hidden Number Problem
inferred← citeshttps://doi.org/10.1007/3-540-45708-9_13openalex-snapshot
Private Computation — k-Connected versus 1-Connected Networks
inferred← citeshttps://doi.org/10.1007/3-540-45708-9_28openalex-snapshot
Hidden Number Problem with the Trace and Bit Security of XTR and LUC
inferred← citeshttps://doi.org/10.1007/3-540-45708-9_29openalex-snapshot
Expanding Pseudorandom Functions; or: From Known-Plaintext Security to Chosen-Plaintext Security
inferred← citeshttps://doi.org/10.1007/3-540-45708-9_38openalex-snapshot
Unique Signatures and Verifiable Random Functions from the DH-DDH Separation
inferred← citeshttps://doi.org/10.1007/3-540-45726-7_15openalex-snapshot
Randomness-Optimal Characterization of Two NP Proof Systems
inferred← citeshttps://doi.org/10.1007/3-540-45726-7_17openalex-snapshot
Derandomization That Is Rarely Wrong from Short Advice That Is Typically Good
inferred← citeshttps://doi.org/10.1007/3-540-45841-7_26openalex-snapshot
A Quantum Goldreich-Levin Theorem with Cryptographic Applications
inferred← citeshttps://doi.org/10.1007/3-540-45995-2_14openalex-snapshot
The Hidden Number Problem in Extension Fields and Its Applications
inferred← citeshttps://doi.org/10.1007/3-540-46035-7_24openalex-snapshot
A Practice-Oriented Treatment of Pseudorandom Number Generators
inferred← citeshttps://doi.org/10.1007/3-540-46035-7_27openalex-snapshot
Efficient Generic Forward-Secure Signatures with an Unbounded Number of Time Periods
inferred← citeshttps://doi.org/10.1007/3-540-46035-7_8openalex-snapshot
Indistinguishability of Random Systems
inferred← citeshttps://doi.org/10.1007/3-540-46035-7_9openalex-snapshot
How to Fool an Unbounded Adversary with a Short Key
inferred← citeshttps://doi.org/10.1007/3-540-46416-6_37openalex-snapshot
A Construction for One Way Hash Functions and Pseudorandom Bit Generators
inferred← citeshttps://doi.org/10.1007/3-540-46513-8_3openalex-snapshot
Elliptic Curve Pseudorandom Sequence Generators
inferred← citeshttps://doi.org/10.1007/3-540-46766-1_2openalex-snapshot
Deriving the Complete Knowledge of Participants in Cryptographic Protocols
inferred← citeshttps://doi.org/10.1007/3-540-46766-1_32openalex-snapshot
Secure Computation
inferred← citeshttps://doi.org/10.1007/3-540-46766-1_9openalex-snapshot
Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing
inferred← citeshttps://doi.org/10.1007/3-540-46877-3_12openalex-snapshot
How to Construct Pseudorandom Permutations from Single Pseudorandom Functions
inferred← citeshttps://doi.org/10.1007/3-540-46885-4_2openalex-snapshot
A Secure Public-Key Authentication Scheme
inferred← citeshttps://doi.org/10.1007/3-540-46885-4_42openalex-snapshot
On the Security of Schnorr’s Pseudo Random Generator
inferred← citeshttps://doi.org/10.1007/3-540-46885-4_60openalex-snapshot
Fast Generation of Secure RSA-Moduli with Almost Maximal Diversity
inferred← citeshttps://doi.org/10.1007/3-540-47555-9_21openalex-snapshot
A Simplified and Generalized Treatment of Luby-Rackoff Pseudorandom Permutation Generators
inferred← citeshttps://doi.org/10.1007/3-540-47555-9_33openalex-snapshot
Local Randomness in Candidate One-Way Functions
inferred← citeshttps://doi.org/10.1007/3-540-47721-7_11openalex-snapshot
How to Prove All NP Statements in Zero-Knowledge and a Methodology of Cryptographic Protocol Design (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/3-540-47721-7_31openalex-snapshot
Towards a Theory of Software Protection (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/3-540-47721-7_7openalex-snapshot
A Pseudo-Random Bit Generator Based on Elliptic Logarithms
inferred← citeshttps://doi.org/10.1007/3-540-48071-4_14openalex-snapshot
Perfect Zero-Knowledge Arguments for NP Can Be Based on General Complexity Assumptions
inferred← citeshttps://doi.org/10.1007/3-540-48071-4_16openalex-snapshot
Invariant Signatures and Non-Interactive Zero-Knowledge Proofs are Equivalent
inferred← citeshttps://doi.org/10.1007/3-540-48071-4_20openalex-snapshot
Practical Approaches to Attaining Security against Adaptively Chosen Ciphertext Attacks
inferred← citeshttps://doi.org/10.1007/3-540-48071-4_30openalex-snapshot
Necessary and Sufficient Conditions for Collision-Free Hashing
inferred← citeshttps://doi.org/10.1007/3-540-48071-4_9openalex-snapshot
Fair Public-Key Cryptosystems
inferred← citeshttps://doi.org/10.1007/3-540-48184-2_10openalex-snapshot
Cryptographic Computation: Secure Fault-Tolerant Protocols and the Public-Key Model (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/3-540-48184-2_3openalex-snapshot
Special Uses and Abuses of the Fiat-Shamir Passport Protocol (extended abstract)
inferred← citeshttps://doi.org/10.1007/3-540-48184-2_33openalex-snapshot
How to Make Replicated Data Secure
inferred← citeshttps://doi.org/10.1007/3-540-48285-7_23openalex-snapshot
Interactive Hashing Simplifies Zero-Knowledge Protocol Design
inferred← citeshttps://doi.org/10.1007/3-540-48285-7_36openalex-snapshot
Global, Unpredictable Bit Generation Without Broadcast
inferred← citeshttps://doi.org/10.1007/3-540-48329-2_21openalex-snapshot
Entity Authentication and Key Distribution
inferred← citeshttps://doi.org/10.1007/3-540-48329-2_3openalex-snapshot
The Shrinking Generator
inferred← citeshttps://doi.org/10.1007/3-540-48329-2_36openalex-snapshot
Another Method for Attaining Security Against Adaptively Chosen Ciphertext Attacks
inferred← citeshttps://doi.org/10.1007/3-540-48405-1_37openalex-snapshot
Compressing Cryptographic Resources
inferred← citeshttps://doi.org/10.1007/3-540-48519-8_21openalex-snapshot
High-Speed Pseudorandom Number Generation with Small Memory
inferred← citeshttps://doi.org/10.1007/3-540-48523-6_15openalex-snapshot
Small Pseudo-Random Sets Yield Hard Functions: New Tight Explicit Lower Bounds for Branching Programs
inferred← citeshttps://doi.org/10.1007/3-540-48523-6_24openalex-snapshot
Non-interactive Zero-Knowledge: A Low-Randomness Characterization of NP (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/3-540-48658-5_13openalex-snapshot
Cryptographic Randomness from Air Turbulence in Disk Drives
inferred← citeshttps://doi.org/10.1007/3-540-48658-5_36openalex-snapshot
A Randomness-Rounds Tradeoff in Private Computation
inferred← citeshttps://doi.org/10.1007/3-540-48910-x_32openalex-snapshot
Efficient Communication-Storage Tradeoffs for Multicast Encryption
inferred← citeshttps://doi.org/10.1007/3-540-48969-x_1openalex-snapshot
Practice-Oriented Provable-Security
inferred← citeshttps://doi.org/10.1007/3-540-49162-7_3openalex-snapshot
On the Security of Random Sources
inferred← citeshttps://doi.org/10.1007/3-540-49730-7_6openalex-snapshot
Cryptographic Limitations on Parallelizing Membership and Equivalence Queries with Applications to Random Self-Reductions
inferred← citeshttps://doi.org/10.1007/3-540-54195-0_66openalex-snapshot
Duality between two cryptographic primitives
inferred← citeshttps://doi.org/10.1007/3-540-55210-3_203openalex-snapshot
Secure commitment against a powerful adversary
inferred← citeshttps://doi.org/10.1007/3-540-55808-x_10openalex-snapshot
The complexity of graph connectivity
inferred← citeshttps://doi.org/10.1007/3-540-56939-1_78openalex-snapshot
Secure and efficient off-line digital money (extended abstract)
inferred← citeshttps://doi.org/10.1007/3-540-57220-1_56openalex-snapshot
A practical digital multisignature scheme based on discrete logarithms (extended abstract)
inferred← citeshttps://doi.org/10.1007/3-540-57220-1_77openalex-snapshot
Non-interactive generation of shared pseudorandom sequences
inferred← citeshttps://doi.org/10.1007/3-540-57220-1_81openalex-snapshot
On bit correlations among preimages of “Many to one” One-way functions
inferred← citeshttps://doi.org/10.1007/3-540-57332-1_23openalex-snapshot
Revealing information with partial period correlations (extended abstract)
inferred← citeshttps://doi.org/10.1007/3-540-57332-1_35openalex-snapshot
Formal verification of probabilistic properties in cryptographic protocols
inferred← citeshttps://doi.org/10.1007/3-540-57332-1_8openalex-snapshot
How to construct a family of strong one way permutations
inferred← citeshttps://doi.org/10.1007/3-540-58691-1_70openalex-snapshot
Open problems in number theoretic complexity, II
inferred← citeshttps://doi.org/10.1007/3-540-58715-2_130openalex-snapshot
My favorite ten complexity theorems of the past decade
inferred← citeshttps://doi.org/10.1007/3-540-59042-0_61openalex-snapshot
Pseudorandom generators and the frequency of simplicity
inferred← citeshttps://doi.org/10.1007/3-540-60865-6_41openalex-snapshot
ISAAC
inferred← citeshttps://doi.org/10.1007/3-540-60922-9_27openalex-snapshot
Optimal bounds on the approximation of boolean functions with consequences on the concept of hardness
inferred← citeshttps://doi.org/10.1007/3-540-61440-0_142openalex-snapshot
Hitting sets derandomize BPP
inferred← citeshttps://doi.org/10.1007/3-540-63165-8_175openalex-snapshot
Worst-case hardness suffices for derandomization: A new method for hardness-randomness trade-offs
inferred← citeshttps://doi.org/10.1007/3-540-63248-4_14openalex-snapshot
Using hard problems to derandomize algorithms: An incomplete survey
inferred← citeshttps://doi.org/10.1007/3-540-63248-4_8openalex-snapshot
Super-bits, demi-bits, and NP/qpoly-natural proofs
inferred← citeshttps://doi.org/10.1007/3-540-68339-9_22openalex-snapshot
An Efficient Pseudo-Random Generator Provably as Secure as Syndrome Decoding
inferred← citeshttps://doi.org/10.1007/3-540-68339-9_23openalex-snapshot
On the Existence of Secure Feedback Registers
inferred← citeshttps://doi.org/10.1007/3-540-68339-9_27openalex-snapshot
Foiling Birthday Attacks in Length-Doubling Transformations
inferred← citeshttps://doi.org/10.1007/3-540-68697-5_10openalex-snapshot
All Bits in ax + b mod p are Hard
inferred← citeshttps://doi.org/10.1007/3-540-69053-0_19openalex-snapshot
Stronger Security Proofs for RSA and Rabin Bits
inferred← citeshttps://doi.org/10.1007/3-540-69053-0_20openalex-snapshot
Round-Optimal Zero-Knowledge Arguments Based on Any One-Way Function
inferred← citeshttps://doi.org/10.1007/3-7643-7394-6_3openalex-snapshot
Foundations of Modern Cryptography
inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_199openalex-snapshot
Learning Significant Fourier Coefficients over Finite Abelian Groups
inferred← citeshttps://doi.org/10.1007/978-0-387-34873-5_14openalex-snapshot
A Practical Conference Key Distribution System
inferred← citeshttps://doi.org/10.1007/978-0-387-71817-0_2openalex-snapshot
Random Number Generators for Cryptographic Applications
inferred← citeshttps://doi.org/10.1007/978-1-4419-5906-5_150openalex-snapshot
OAEP: Optimal Asymmetric Encryption Padding
inferred← citeshttps://doi.org/10.1007/978-1-4419-5906-5_153openalex-snapshot
RSA Public-Key Encryption
inferred← citeshttps://doi.org/10.1007/978-1-4419-5906-5_201openalex-snapshot
Entropy Sources
inferred← citeshttps://doi.org/10.1007/978-1-4419-5906-5_412openalex-snapshot
Hard-Core Bit
inferred← citeshttps://doi.org/10.1007/978-1-4471-5079-4_11openalex-snapshot
The Blum-Blum-Shub Generator and Related Ciphers
inferred← citeshttps://doi.org/10.1007/978-1-4612-1872-2_5openalex-snapshot
A Taxonomy of Proof Systems
inferred← citeshttps://doi.org/10.1007/978-1-4612-3352-7_30openalex-snapshot
Removing Interaction from Zero-Knowledge Proofs
inferred← citeshttps://doi.org/10.1007/978-1-4613-9323-8_31openalex-snapshot
Fair Games Against an All-Powerful Adversary
inferred← citeshttps://doi.org/10.1007/978-1-4615-0013-1_18openalex-snapshot
Derandomization in Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4684-4730-9_26openalex-snapshot
RSA bits are .732 + ε secure
inferred← citeshttps://doi.org/10.1007/978-1-4757-0602-4_6openalex-snapshot
Comparison of Two Pseudo-Random Number Generators
inferred← citeshttps://doi.org/10.1007/978-1-4757-2226-0_6openalex-snapshot
The Discrete Logarithm Problem
inferred← citeshttps://doi.org/10.1007/978-1-4842-8105-5_7openalex-snapshot
Pseudorandom Number Generators
showing the first 200 of 1122
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.