On the public citation graph

Foundations of Cryptography – A Primer

https://doi.org/10.1561/0400000001
0 signed · 95 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.1002/j.1538-7305.1949.tb00928.xopenalex-snapshot
Communication Theory of Secrecy Systems*
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-44598-6_27openalex-snapshot
Improved Non-committing Encryption Schemes Based on a General Complexity Assumption
inferredcites →https://doi.org/10.1007/3-540-44647-8_10openalex-snapshot
Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation
inferredcites →https://doi.org/10.1007/3-540-44647-8_33openalex-snapshot
Robust Non-interactive Zero Knowledge
inferredcites →https://doi.org/10.1007/3-540-48658-5_15openalex-snapshot
LFSR-based Hashing and Authentication
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-48910-x_29openalex-snapshot
On the Concurrent Composition of Zero-Knowledge Proofs
inferredcites →https://doi.org/10.1007/3-540-68697-5_1openalex-snapshot
Keying Hash Functions for Message Authentication
inferredcites →https://doi.org/10.1007/978-1-4757-0602-4_19openalex-snapshot
A Randomized Protocol for Signing Contracts
inferredcites →https://doi.org/10.1007/bf00195207openalex-snapshot
Definitions and properties of zero-knowledge proof systems
inferredcites →https://doi.org/10.1007/bf00196771openalex-snapshot
Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority
inferredcites →https://doi.org/10.1007/bf00196774openalex-snapshot
Bit commitment using pseudorandomness
inferredcites →https://doi.org/10.1007/bf00208001openalex-snapshot
How To Construct Constant-Round Zero-Knowledge Proof Systems for NP
inferredcites →https://doi.org/10.1007/bf02620230openalex-snapshot
A uniform-complexity treatment of encryption and zero-knowledge
inferredcites →https://doi.org/10.1007/bfb0055718openalex-snapshot
Relations among notions of security for public-key encryption schemes
inferredcites →https://doi.org/10.1007/s00037-002-0169-0openalex-snapshot
On interactive proofs with a laconic prover
inferredcites →https://doi.org/10.1007/s001459910003openalex-snapshot
Player Simulation and General Adversary Structures in Perfect Multiparty Computation
inferredcites →https://doi.org/10.1007/s001459910006openalex-snapshot
Security and Composition of Multiparty Cryptographic Protocols
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/s0020-0190(98)00116-1openalex-snapshot
On the complexity of interactive proofs with bounded communication
inferredcites →https://doi.org/10.1017/cbo9780511546891openalex-snapshot
Foundations of Cryptography
inferredcites →https://doi.org/10.1017/cbo9780511721656openalex-snapshot
Foundations of Cryptography
inferredcites →https://doi.org/10.1109/focs.2004.13openalex-snapshot
An Unconditional Study of Computational Zero Knowledge
inferredcites →https://doi.org/10.1109/focs.2004.71openalex-snapshot
Universally Composable Protocols with Relaxed Set-Up Assumptions
inferredcites →https://doi.org/10.1109/sp.1980.10006openalex-snapshot
Protocols for Public Key Cryptosystems
inferredcites →https://doi.org/10.1137/0212045openalex-snapshot
Authenticated Algorithms for Byzantine Agreement
inferredcites →https://doi.org/10.1137/0213053openalex-snapshot
How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
inferredcites →https://doi.org/10.1137/0217014openalex-snapshot
Privacy Amplification by Public Discussion
inferredcites →https://doi.org/10.1137/0218012openalex-snapshot
The Knowledge Complexity of Interactive Proof Systems
inferredcites →https://doi.org/10.1137/0404004openalex-snapshot
A Zero-One Law for Boolean Privacy
inferredcites →https://doi.org/10.1137/s0097539703427975openalex-snapshot
Strict Polynomial-Time in Simulation and Extraction
inferredcites →https://doi.org/10.1137/s0097539791220688openalex-snapshot
On the Composition of Zero-Knowledge Proof Systems
inferredcites →https://doi.org/10.1137/s0097539792230010openalex-snapshot
Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
inferredcites →https://doi.org/10.1137/s0097539793244708openalex-snapshot
A Pseudorandom Generator from any One-way Function
inferredcites →https://doi.org/10.1137/s0097539795284959openalex-snapshot
Computationally Sound Proofs
inferredcites →https://doi.org/10.1137/s0097539795291562openalex-snapshot
Nonmalleable Cryptography
inferredcites →https://doi.org/10.1145/112600.112605openalex-snapshot
How to withstand mobile virus attacks (extended abstract)
inferredcites →https://doi.org/10.1145/138027.138036openalex-snapshot
Perfectly secure message transmission
inferredcites →https://doi.org/10.1145/146585.146605openalex-snapshot
Algebraic methods for interactive proof systems
inferredcites →https://doi.org/10.1145/146585.146609openalex-snapshot
IP = PSPACE
inferredcites →https://doi.org/10.1145/167088.167109openalex-snapshot
Asynchronous secure computation
inferredcites →https://doi.org/10.1145/226643.226652openalex-snapshot
Interactive proofs and the hardness of approximating cliques
inferredcites →https://doi.org/10.1145/273865.273901openalex-snapshot
Probabilistic checking of proofs
inferredcites →https://doi.org/10.1145/278298.278306openalex-snapshot
Proof verification and the hardness of approximation problems
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/41840.41862openalex-snapshot
Achieving independence in logarithmic number of rounds
inferredcites →https://doi.org/10.1145/636865.636868openalex-snapshot
A complete problem for statistical zero knowledge
inferredcites →https://doi.org/10.1145/6490.6503openalex-snapshot
How to construct random functions

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-1-4471-4555-4_12openalex-snapshot
Privacy in Recommender Systems
inferred← citeshttps://doi.org/10.1007/978-3-030-00012-7_63openalex-snapshot
Survey and Analysis of Cryptographic Techniques for Privacy Protection in Recommender Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-70411-6_44openalex-snapshot
An Enhanced Hybrid Cryptography Model for Online Banking Authentication and Security
inferred← citeshttps://doi.org/10.1007/978-3-032-07035-7_23openalex-snapshot
CCBNet : Confidential Collaborative Bayesian Networks Inference
inferred← citeshttps://doi.org/10.1007/978-3-540-85886-7_19openalex-snapshot
An RSA-Based (t,n) Threshold Proxy Signature Scheme without Any Trusted Combiner
inferred← citeshttps://doi.org/10.1007/978-3-642-01957-9_8openalex-snapshot
Efficient Robust Private Set Intersection
inferred← citeshttps://doi.org/10.1007/978-3-642-21554-4_8openalex-snapshot
Secure Efficient Multiparty Computing of Multivariate Polynomials and Applications
inferred← citeshttps://doi.org/10.1007/978-3-642-40203-6_23openalex-snapshot
Efficient Privacy-Enhanced Familiarity-Based Recommender System
inferred← citeshttps://doi.org/10.1007/978-3-662-62271-1_3openalex-snapshot
From Task Tuning to Task Assignment in Privacy-Preserving Crowdsourcing Platforms
inferred← citeshttps://doi.org/10.1007/s10619-013-7122-xopenalex-snapshot
MET𝔸P: revisiting Privacy-Preserving Data Publishing using secure devices
inferred← citeshttps://doi.org/10.1007/s11227-013-1063-zopenalex-snapshot
On private Hamming distance computation
inferred← citeshttps://doi.org/10.1016/j.array.2026.100712openalex-snapshot
HXTS: An efficient tweakable block cipher solution for enhancing sector data security
inferred← citeshttps://doi.org/10.1016/j.jpdc.2019.10.008openalex-snapshot
Towards secure big data analytic for cloud-enabled applications with fully homomorphic encryption
inferred← citeshttps://doi.org/10.1016/j.jss.2021.111045openalex-snapshot
Practical hybrid confidentiality-based analytics framework with Intel SGX
inferred← citeshttps://doi.org/10.1016/j.scs.2018.02.013openalex-snapshot
Privacy-enhancing aggregation of Internet of Things data via sensors grouping
inferred← citeshttps://doi.org/10.1016/j.scs.2019.101426openalex-snapshot
Enhancing privacy of electricity consumption in smart cities through morphing of anticipated demand pattern utilizing self-elasticity and genetic algorithms
inferred← citeshttps://doi.org/10.1017/s0960129512000825openalex-snapshot
Quantum attacks on pseudorandom generators
inferred← citeshttps://doi.org/10.1038/s41598-021-03762-2openalex-snapshot
Modelling imperfect knowledge via location semantics for realistic privacy risks estimation in trajectory data
inferred← citeshttps://doi.org/10.1073/pnas.1801839117openalex-snapshot
The complexity of human computation via a concrete model with an application to passwords
inferred← citeshttps://doi.org/10.1088/2040-8978/18/1/015202openalex-snapshot
Implementation of a two-state quantum bit commitment protocol in optical fibers
inferred← citeshttps://doi.org/10.1109/bigdataservice52369.2021.00021openalex-snapshot
FMFParking: Federated Matrix Factorization For Parking Lot Recommendation
inferred← citeshttps://doi.org/10.1109/cdc49753.2023.10384054openalex-snapshot
Robust Decentralised Proof-of-Position Algorithms for Smart City Applications
inferred← citeshttps://doi.org/10.1109/cec.2006.1688297openalex-snapshot
Kolmogorov complexity, Optimization and Hardness
inferred← citeshttps://doi.org/10.1109/icde.2018.00082openalex-snapshot
A Differentially Private Index for Range Query Processing in Clouds
inferred← citeshttps://doi.org/10.1109/imcsit.2008.4747290openalex-snapshot
The quasi-one-way function and its applications to image watermarking
inferred← citeshttps://doi.org/10.1109/jiot.2019.2943030openalex-snapshot
AnyCharge: An IoT-Based Wireless Charging Service for the Public
inferred← citeshttps://doi.org/10.1109/jsac.2022.3142366openalex-snapshot
Efficient Recovery of a Shared Secret via Cooperation: Applications to SDMM and PIR
inferred← citeshttps://doi.org/10.1109/trustcom.2015.478openalex-snapshot
Secure Two-Party Rank Correlation Computations for Recommender Systems
inferred← citeshttps://doi.org/10.1109/wetice49692.2020.00019openalex-snapshot
Secure Data Analytics for IoT Cloud-enabled Framework Using Intel SGX
inferred← citeshttps://doi.org/10.1111/risa.13577openalex-snapshot
The Need to Reconcile Concepts that Characterize Systems Facing Threats
inferred← citeshttps://doi.org/10.1145/1562164.1562186openalex-snapshot
The status of the P versus NP problem
inferred← citeshttps://doi.org/10.1145/1866855.1866862openalex-snapshot
Efficient CRL search in vehicular network PKIS
inferred← citeshttps://doi.org/10.1145/2723372.2749453openalex-snapshot
Chiaroscuro
inferred← citeshttps://doi.org/10.1145/301250.301397openalex-snapshot
Pseudorandom generators without the XOR Lemma (extended abstract)
inferred← citeshttps://doi.org/10.1145/3375395.3387658openalex-snapshot
A Framework for Adversarially Robust Streaming Algorithms
inferred← citeshttps://doi.org/10.1145/3487063openalex-snapshot
Universal Equivalence and Majority of Probabilistic Programs over Finite Fields
inferred← citeshttps://doi.org/10.1145/3498334openalex-snapshot
A Framework for Adversarially Robust Streaming Algorithms
inferred← citeshttps://doi.org/10.1145/3798129.3800914openalex-snapshot
Provable Long-Range Benefits of Next-Token Prediction
inferred← citeshttps://doi.org/10.1155/2014/581426openalex-snapshot
Preserving Differential Privacy for Similarity Measurement in Smart Environments
inferred← citeshttps://doi.org/10.14722/ndss.2023.23088openalex-snapshot
Trellis: Robust and Scalable Metadata-private Anonymous Broadcast
inferred← citeshttps://doi.org/10.1561/0100000044openalex-snapshot
Combinatorial Designs for Authentication and Secrecy Codes
inferred← citeshttps://doi.org/10.26583/bit.2017.2.09openalex-snapshot
On the Relations between the Attacks on Symmetric Homomorphic Encryption over the Residue Ring
inferred← citeshttps://doi.org/10.3929/ethz-b-000245849openalex-snapshot
Privacy-enhancing Aggregation of Internet of Things Data via Sensors Grouping
inferred← citeshttps://doi.org/10.3990/1.9789036535939openalex-snapshot
Cryptographically-enhanced privacy for recommender systems
inferred← citeshttps://doi.org/10.70675/3d4ca379za7c3z40e9zb7c1zf7f24f9c5db5openalex-snapshot
Protection des travailleurs dans les plateformes de crowdsourcing : une perspective technique
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.