On the public citation graph
On the foundations of modern cryptography
0 signed · 151 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/j.1538-7305.1949.tb00928.xopenalex-snapshot
Communication Theory of Secrecy Systems*
inferredcites →https://doi.org/10.1006/jcss.1998.1618openalex-snapshot
Synthesizers and Their Application to the Parallel Construction of Pseudo-Random Functions
inferredcites →https://doi.org/10.1007/0-387-34799-2_15openalex-snapshot
How To Sign Given Any Trapdoor Function
inferredcites →https://doi.org/10.1007/0-387-34805-0_21openalex-snapshot
A Certified Digital Signature
inferredcites →https://doi.org/10.1007/0-387-34805-0_39openalex-snapshot
A Design Principle for Hash Functions
inferredcites →https://doi.org/10.1007/3-540-38424-3_6openalex-snapshot
Fair Computation of General Functions in Presence of Immoral Majority
inferredcites →https://doi.org/10.1007/3-540-39118-5_19openalex-snapshot
Collision Free Hash Functions and Public Key Signature Schemes
inferredcites →https://doi.org/10.1007/3-540-39568-7_23openalex-snapshot
An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information
inferredcites →https://doi.org/10.1007/3-540-44750-4_2openalex-snapshot
XOR MACs: New Methods for Message Authentication Using Finite Pseudorandom Functions
inferredcites →https://doi.org/10.1007/3-540-44750-4_26openalex-snapshot
Honest Verifier vs Dishonest Verifier in Public Coin Zero-Knowledge Proofs
inferredcites →https://doi.org/10.1007/3-540-44750-4_27openalex-snapshot
Proactive Secret Sharing Or: How to Cope With Perpetual Leakage
inferredcites →https://doi.org/10.1007/3-540-46766-1_31openalex-snapshot
Foundations of Secure Interactive Computing
inferredcites →https://doi.org/10.1007/3-540-47721-7_12openalex-snapshot
How To Prove Yourself: Practical Solutions to Identification and Signature Problems
inferredcites →https://doi.org/10.1007/3-540-47721-7_16openalex-snapshot
Zero-Knowledge Simulation of Boolean Circuits
inferredcites →https://doi.org/10.1007/3-540-48071-4_10openalex-snapshot
Pricing via Processing or Combatting Junk Mail
inferredcites →https://doi.org/10.1007/3-540-48071-4_14openalex-snapshot
Perfect Zero-Knowledge Arguments for NP Can Be Based on General Complexity Assumptions
inferredcites →https://doi.org/10.1007/3-540-48071-4_28openalex-snapshot
On Defining Proofs of Knowledge
inferredcites →https://doi.org/10.1007/3-540-48071-4_9openalex-snapshot
Fair Public-Key Cryptosystems
inferredcites →https://doi.org/10.1007/3-540-48184-2_32openalex-snapshot
A Digital Signature Based on a Conventional Encryption Function
inferredcites →https://doi.org/10.1007/3-540-48184-2_5openalex-snapshot
Non-Interactive Zero-Knowledge Proof Systems
inferredcites →https://doi.org/10.1007/3-540-48329-2_21openalex-snapshot
Entity Authentication and Key Distribution
inferredcites →https://doi.org/10.1007/3-540-48658-5_22openalex-snapshot
Incremental Cryptography: The Case of Hashing and Signing
inferredcites →https://doi.org/10.1007/3-540-48658-5_23openalex-snapshot
An Efficient Existentially Unforgeable Signature Scheme and its Applications
inferredcites →https://doi.org/10.1007/3-540-48658-5_32openalex-snapshot
The Security of Cipher Block Chaining
inferredcites →https://doi.org/10.1007/3-540-48658-5_38openalex-snapshot
Maintaining Security in the Presence of Transient Faults
inferredcites →https://doi.org/10.1007/3-540-68339-9_34openalex-snapshot
The Exact Security of Digital Signatures-How to Sign with RSA and Rabin
inferredcites →https://doi.org/10.1007/3-540-68697-5_1openalex-snapshot
Keying Hash Functions for Message Authentication
inferredcites →https://doi.org/10.1007/3-540-69053-0_19openalex-snapshot
Stronger Security Proofs for RSA and Rabin Bits
inferredcites →https://doi.org/10.1007/3-540-69053-0_4openalex-snapshot
On the Importance of Checking Cryptographic Protocols for Faults
inferredcites →https://doi.org/10.1007/978-1-4757-0602-4_18openalex-snapshot
Blind Signatures for Untraceable Payments
inferredcites →https://doi.org/10.1007/bf00189260openalex-snapshot
Efficient cryptographic schemes provably as secure as subset sum
inferredcites →https://doi.org/10.1007/bf00195207openalex-snapshot
Definitions and properties of zero-knowledge proof systems
inferredcites →https://doi.org/10.1007/bf00196774openalex-snapshot
Bit commitment using pseudorandomness
inferredcites →https://doi.org/10.1007/bf02254791openalex-snapshot
On-line/off-line digital signatures
inferredcites →https://doi.org/10.1007/bf02579323openalex-snapshot
One way functions and pseudorandom generators
inferredcites →https://doi.org/10.1007/bfb0052233openalex-snapshot
Security of blind digital signatures
inferredcites →https://doi.org/10.1007/bfb0052245openalex-snapshot
Visual authentication and identification
inferredcites →https://doi.org/10.1007/bfb0052255openalex-snapshot
Towards realizing random oracles: Hash functions that hide all partial information
inferredcites →https://doi.org/10.1007/s001459900012openalex-snapshot
Efficient Cryptographic Schemes Provably as Secure as Subset Sum
inferredcites →https://doi.org/10.1007/s001459900032openalex-snapshot
An Efficient Noninteractive Zero-Knowledge Proof System for NP with General Assumptions
inferredcites →https://doi.org/10.1016/0022-0000(79)90044-8openalex-snapshot
Universal classes of hash functions
inferredcites →https://doi.org/10.1016/0022-0000(81)90033-7openalex-snapshot
New hash functions and their use in authentication and set equality
inferredcites →https://doi.org/10.1016/0022-0000(84)90070-9openalex-snapshot
Probabilistic encryption
inferredcites →https://doi.org/10.1016/0022-0000(88)90005-0openalex-snapshot
Minimum disclosure proofs of knowledge
inferredcites →https://doi.org/10.1016/0022-0000(93)90038-xopenalex-snapshot
The discrete logarithm modulo a composite hides 0(n) Bits
inferredcites →https://doi.org/10.1109/fscs.1990.89549openalex-snapshot
Multiple non-interactive zero knowledge proofs based on a single random string
inferredcites →https://doi.org/10.1109/fscs.1990.89550openalex-snapshot
Security preserving amplification of hardness
inferredcites →https://doi.org/10.1109/istcs.1993.253489openalex-snapshot
One-way functions are essential for non-trivial zero-knowledge
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.95openalex-snapshot
Theory and application of trapdoor functions
inferredcites →https://doi.org/10.1109/sfcs.1984.715948openalex-snapshot
Efficient And Secure Pseudo-Random Number Generation
inferredcites →https://doi.org/10.1109/sfcs.1985.64openalex-snapshot
Verifiable secret sharing and achieving simultaneity in the presence of faults
inferredcites →https://doi.org/10.1109/sfcs.1986.25openalex-snapshot
How to generate and exchange secrets
inferredcites →https://doi.org/10.1109/sfcs.1987.4openalex-snapshot
A practical scheme for non-interactive verifiable secret sharing
inferredcites →https://doi.org/10.1109/sfcs.1989.63483openalex-snapshot
One-way functions are essential for complexity based cryptography
inferredcites →https://doi.org/10.1109/sfcs.1995.492461openalex-snapshot
Private information retrieval
inferredcites →https://doi.org/10.1109/sfcs.1995.492474openalex-snapshot
Synthesizers and their application to the parallel construction of pseudo-random functions
inferredcites →https://doi.org/10.1109/sfcs.1996.548509openalex-snapshot
Incoercible multiparty computation
inferredcites →https://doi.org/10.1109/sfcs.1996.548510openalex-snapshot
Pseudorandom functions revisited: the cascade construction and its concrete security
inferredcites →https://doi.org/10.1109/sp.1980.10006openalex-snapshot
Protocols for Public Key Cryptosystems
inferredcites →https://doi.org/10.1109/tit.1976.1055638openalex-snapshot
New directions in cryptography
inferredcites →https://doi.org/10.1137/0213053openalex-snapshot
How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
inferredcites →https://doi.org/10.1137/0215025openalex-snapshot
A Simple Unpredictable Pseudo-Random Number Generator
inferredcites →https://doi.org/10.1137/0217013openalex-snapshot
RSA and Rabin Functions: Certain Parts are as Hard as the Whole
inferredcites →https://doi.org/10.1137/0217016openalex-snapshot
Reconstructing Truncated Integer Variables Satisfying Linear Congruences
inferredcites →https://doi.org/10.1137/0217017openalex-snapshot
A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
inferredcites →https://doi.org/10.1137/0217022openalex-snapshot
How to Construct Pseudorandom Permutations from Pseudorandom Functions
inferredcites →https://doi.org/10.1137/0218012openalex-snapshot
The Knowledge Complexity of Interactive Proof Systems
inferredcites →https://doi.org/10.1137/s0097539791220688openalex-snapshot
On the Composition of Zero-Knowledge Proof Systems
inferredcites →https://doi.org/10.1145/100216.100269openalex-snapshot
One-way functions are necessary and sufficient for secure signatures
inferredcites →https://doi.org/10.1145/100216.100272openalex-snapshot
Witness indistinguishable and witness hiding protocols
inferredcites →https://doi.org/10.1145/100216.100273openalex-snapshot
Public-key cryptosystems provably secure against chosen ciphertext attacks
inferredcites →https://doi.org/10.1145/112600.112605openalex-snapshot
How to withstand mobile virus attacks (extended abstract)
inferredcites →https://doi.org/10.1145/116825.116852openalex-snapshot
Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
inferredcites →https://doi.org/10.1145/12130.12168openalex-snapshot
Limits on the security of coin flips when half the processors are faulty
inferredcites →https://doi.org/10.1145/129712.129782openalex-snapshot
A note on efficient zero-knowledge proofs and arguments (extended abstract)
inferredcites →https://doi.org/10.1145/147508.147537openalex-snapshot
How to sign given any trapdoor permutation
inferredcites →https://doi.org/10.1145/195058.195405openalex-snapshot
How to share a function securely
inferredcites →https://doi.org/10.1145/225058.225080openalex-snapshot
Incremental cryptography and application to virus protection
inferredcites →https://doi.org/10.1145/225058.225084openalex-snapshot
Provably secure session key distribution
inferredcites →https://doi.org/10.1145/233551.233553openalex-snapshot
Software protection and simulation on oblivious RAMs
inferredcites →https://doi.org/10.1145/258533.258581openalex-snapshot
On the construction of pseudo-random permutations
inferredcites →https://doi.org/10.1145/258533.258609openalex-snapshot
Computationally private information retrieval (extended abstract)
inferredcites →https://doi.org/10.1145/259380.259411openalex-snapshot
Maintaining authenticated communication in the presence of break-ins
inferredcites →https://doi.org/10.1145/357980.358017openalex-snapshot
A method for obtaining digital signatures and public-key cryptosystems
inferredcites →https://doi.org/10.1145/359340.359342openalex-snapshot
A method for obtaining digital signatures and public-key cryptosystems
inferredcites →https://doi.org/10.1145/58562.59305openalex-snapshot
Inferring sequences produced by pseudo-random number generators
inferredcites →https://doi.org/10.1145/62212.62213openalex-snapshot
Completeness theorems for non-cryptographic fault-tolerant distributed computation
inferredcites →https://doi.org/10.1145/62212.62214openalex-snapshot
Multiparty unconditionally secure protocols
inferredcites →https://doi.org/10.1145/62212.62222openalex-snapshot
Non-interactive zero-knowledge and its applications
inferredcites →https://doi.org/10.1145/62212.62223openalex-snapshot
Multi-prover interactive proofs: how to remove intractability
inferredcites →https://doi.org/10.1145/73007.73010openalex-snapshot
A hard-core predicate for all one-way functions
inferredcites →https://doi.org/10.1145/73007.73011openalex-snapshot
Universal one-way hash functions and their cryptographic applications
inferredcites →https://doi.org/10.1145/73007.73012openalex-snapshot
Limits on the provable consequences of one-way permutations
inferredcites →https://doi.org/10.1145/73007.73014openalex-snapshot
Verifiable secret sharing and multiparty protocols with honest majority
inferredcites →https://doi.org/10.1515/9780691206844openalex-snapshot
Pseudorandomness and Cryptographic Applications
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11554868_11openalex-snapshot
Efficient Secure Group Signatures with Dynamic Joins and Keeping Anonymity Against Group Managers
inferred← citeshttps://doi.org/10.1007/3-540-44598-6_9openalex-snapshot
Quantum Public-Key Cryptosystems
inferred← citeshttps://doi.org/10.1007/3-540-44709-1_25openalex-snapshot
Universal Exponentiation Algorithm A First Step towards Provable SPA-Resistance
inferred← citeshttps://doi.org/10.1007/3-540-44987-6_29openalex-snapshot
Efficient Password-Authenticated Key Exchange Using Human-Memorable Passwords
inferred← citeshttps://doi.org/10.1007/3-540-45309-1_6openalex-snapshot
Semantics and Program Analysis of Computationally Secure Information Flow
inferred← citeshttps://doi.org/10.1007/3-540-45353-9_28openalex-snapshot
Improved Boneh-Shaw Content Fingerprinting
inferred← citeshttps://doi.org/10.1007/3-540-45760-7_18openalex-snapshot
GEM: A Generic Chosen-Ciphertext Secure Encryption Method
inferred← citeshttps://doi.org/10.1007/3-540-48969-x_1openalex-snapshot
Practice-Oriented Provable-Security
inferred← citeshttps://doi.org/10.1007/978-0-387-35691-4_43openalex-snapshot
Security, Fault-Tolerance and Their Verification for Ambient Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-53555-0_16openalex-snapshot
Design of Secure Fair Bidding Scheme Based on Threshold Elliptic Curve ElGamal Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-319-06734-6_22openalex-snapshot
A Second Look at Fischlin’s Transformation
inferred← citeshttps://doi.org/10.1007/978-3-540-24691-6_5openalex-snapshot
Sound Computational Interpretation of Formal Encryption with Composed Keys
inferred← citeshttps://doi.org/10.1007/978-3-540-30220-9_14openalex-snapshot
Online Negative Databases
inferred← citeshttps://doi.org/10.1007/978-3-540-30502-6_2openalex-snapshot
On the Role Definitions in and Beyond Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-540-45146-4_6openalex-snapshot
On Cryptographic Assumptions and Challenges
inferred← citeshttps://doi.org/10.1007/978-3-642-28496-0_18openalex-snapshot
Another Look at Tightness
inferred← citeshttps://doi.org/10.1007/s001450010008openalex-snapshot
Universal Service-Providers for Private Information Retrieval
inferred← citeshttps://doi.org/10.1049/ise2.12003openalex-snapshot
Private feasible solution determination
inferred← citeshttps://doi.org/10.1109/bigdata47090.2019.9006017openalex-snapshot
An Identity Privacy Preserving IoT Data Protection Scheme for Cloud Based Analytics
inferred← citeshttps://doi.org/10.1109/iadcc.2009.4808979openalex-snapshot
Choosing Best Hashing Strategies and Hash Functions
inferred← citeshttps://doi.org/10.1109/icecet58911.2023.10389558openalex-snapshot
Towards Building Quantum Resistant Blockchain
inferred← citeshttps://doi.org/10.1145/276698.276882openalex-snapshot
Robust efficient distributed RSA-key generation
inferred← citeshttps://doi.org/10.1145/277697.277713openalex-snapshot
Universal service-providers for database private information retrieval (extended abstract)
inferred← citeshttps://doi.org/10.12688/f1000research.165637.1openalex-snapshot
MAXEM: A New Pseudo-Random Number Generating Algorithm with Implementation of Modulo Arithmetic, XORShift, and Entropy Modulation
inferred← citeshttps://doi.org/10.1364/oe.431945openalex-snapshot
Image encryption scheme based on alternate quantum walks and discrete cosine transform
inferred← citeshttps://doi.org/10.1504/ijsn.2006.010821openalex-snapshot
Secure scalable group signature with dynamic joins and separable authorities
inferred← citeshttps://doi.org/10.4018/978-1-4666-0282-3.ch011openalex-snapshot
Privacy Preserving Clustering for Distributed Homogeneous Gene Expression Data Sets
inferred← citeshttps://doi.org/10.4018/978-1-4666-2653-9.ch014openalex-snapshot
Privacy Preserving Principal Component Analysis Clustering for Distributed Heterogeneous Gene Expression Datasets
inferred← citeshttps://doi.org/10.4018/978-1-59140-186-5.ch008openalex-snapshot
Data and Application Secutiry for Distributed Application Hosting Services
inferred← citeshttps://doi.org/10.4018/jcmam.2010070102openalex-snapshot
Privacy Preserving Clustering for Distributed Homogeneous Gene Expression Data Sets
inferred← citeshttps://doi.org/10.4018/jcmam.2011100102openalex-snapshot
Privacy Preserving Principal Component Analysis Clustering for Distributed Heterogeneous Gene Expression Datasets
inferred← citeshttps://doi.org/10.5445/ir/1000038387openalex-snapshot
Reflective-Physically Unclonable Function based System for Anti-Counterfeiting
inferred← citeshttps://doi.org/10.70675/b441c3a1zf42cz4cd7z8594z7121c5089d1fopenalex-snapshot
Consensus Byzantin et blockchain : Modèles unifiés et nouveaux protocoles
inferred← citeshttps://doi.org/10.9734/jamcs/2021/v36i130328openalex-snapshot
A New Statistical Test for PRNG Based on the Attendance’s Law
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.