On the public citation graph

Limits on the Provable Consequences of One-way Permutations

https://doi.org/10.1007/0-387-34799-2_2
0 signed · 125 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/0-387-34799-2_19openalex-snapshot
A Basic Theory of Public and Private Cryptosystems
inferredcites →https://doi.org/10.1007/3-540-39799-x_34openalex-snapshot
How to Construct Pseudo-random Permutations from Pseudo-random Functions
inferredcites →https://doi.org/10.1007/3-540-48184-2_4openalex-snapshot
Direct Minimum-Knowledge Computations (Extended Abstract)
inferredcites →https://doi.org/10.1007/bf02351717openalex-snapshot
Zero-knowledge proofs of identity
inferredcites →https://doi.org/10.1016/0304-3975(86)90174-xopenalex-snapshot
Random generation of combinatorial structures from a uniform distribution
inferredcites →https://doi.org/10.1109/sfcs.1982.45openalex-snapshot
Theory and application of trapdoor functions
inferredcites →https://doi.org/10.1109/sfcs.1984.715946openalex-snapshot
A "Paradoxical" Solution To The Signature Problem
inferredcites →https://doi.org/10.1109/tit.1976.1055638openalex-snapshot
New directions in cryptography
inferredcites →https://doi.org/10.1109/tit.1983.1056754openalex-snapshot
Relativized cryptography
inferredcites →https://doi.org/10.1137/0204037openalex-snapshot
Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question
inferredcites →https://doi.org/10.1137/0210008openalex-snapshot
Relative to a Random Oracle A , ${\bf P}^A \ne {\bf NP}^A \ne \text{co-}{\bf NP}^A $ with Probability 1
inferredcites →https://doi.org/10.1137/0213053openalex-snapshot
How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
inferredcites →https://doi.org/10.1145/1008908.1008911openalex-snapshot
Coin flipping by telephone a protocol for solving impossible problems
inferredcites →https://doi.org/10.1145/28395.28419openalex-snapshot
Zero knowledge proofs of identity
inferredcites →https://doi.org/10.1145/28395.28420openalex-snapshot
How to play ANY mental game
inferredcites →https://doi.org/10.1145/322234.322243openalex-snapshot
Alternation
inferredcites →https://doi.org/10.1145/359460.359473openalex-snapshot
Secure communications over insecure channels
inferredcites →https://doi.org/10.1145/361082.361089openalex-snapshot
A high security log-in procedure
inferredcites →https://doi.org/10.1145/6490.6503openalex-snapshot
How to construct random functions
inferredcites →https://doi.org/10.1145/73007.73011openalex-snapshot
Universal one-way hash functions and their 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.2139/ssrn.1157394openalex-extracted
Reducing Complexity Assumptions for Statistically-Hiding Commitment*
inferred← citeshttps://doi.org/10.1007/3-540-44987-6_5openalex-snapshot
How to Convert the Flavor of a Quantum Bit Commitment
inferred← citeshttps://doi.org/10.1007/3-540-58325-4_204openalex-snapshot
Separability and one-way functions
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/978-1-4613-9323-8_30openalex-snapshot
The Varieties of Secure Distributed Computation
inferred← citeshttps://doi.org/10.1007/978-3-030-12612-4_10openalex-snapshot
Doubly Half-Injective PRGs for Incompressible White-Box Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-030-12612-4_16openalex-snapshot
Linking Stam’s Bounds with Generalized Truncation
inferred← citeshttps://doi.org/10.1007/978-3-030-17253-4_20openalex-snapshot
On Tightly Secure Primitives in the Multi-instance Setting
inferred← citeshttps://doi.org/10.1007/978-3-030-26948-7_10openalex-snapshot
How to Build Pseudorandom Functions from Public Random Permutations
inferred← citeshttps://doi.org/10.1007/978-3-030-26954-8_13openalex-snapshot
SpOT-Light: Lightweight Private Set Intersection from Sparse OT Extension
inferred← citeshttps://doi.org/10.1007/978-3-030-36030-6_5openalex-snapshot
A Black-Box Construction of Fully-Simulatable, Round-Optimal Oblivious Transfer from Strongly Uniform Key Agreement
inferred← citeshttps://doi.org/10.1007/978-3-030-40186-3_26openalex-snapshot
Cut-and-Choose for Garbled RAM
inferred← citeshttps://doi.org/10.1007/978-3-030-56784-2_3openalex-snapshot
Indifferentiability for Public Key Cryptosystems
inferred← citeshttps://doi.org/10.1007/978-3-030-56784-2_7openalex-snapshot
The Summation-Truncation Hybrid: Reusing Discarded Bits for Free
inferred← citeshttps://doi.org/10.1007/978-3-030-57990-6_27openalex-snapshot
On the Query Complexity of Constructing PRFs from Non-adaptive PRFs
inferred← citeshttps://doi.org/10.1007/978-3-030-84242-0_17openalex-snapshot
One-Way Functions Imply Secure Computation in a Quantum World
inferred← citeshttps://doi.org/10.1007/978-3-030-84245-1_8openalex-snapshot
On the Round Complexity of Black-Box Secure MPC
inferred← citeshttps://doi.org/10.1007/978-3-030-90453-1_15openalex-snapshot
On Derandomizing Yao’s Weak-to-Strong OWF Construction
inferred← citeshttps://doi.org/10.1007/978-3-030-90456-2_11openalex-snapshot
On the Impossibility of Purely Algebraic Signatures
inferred← citeshttps://doi.org/10.1007/978-3-030-90459-3_24openalex-snapshot
On Actively-Secure Elementary MPC Reductions
inferred← citeshttps://doi.org/10.1007/978-3-030-92078-4_10openalex-snapshot
Batching Base Oblivious Transfers
inferred← citeshttps://doi.org/10.1007/978-3-031-06944-4_24openalex-snapshot
Incompressible Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-031-07085-3_20openalex-snapshot
On Building Fine-Grained One-Way Functions from Strong Average-Case Hardness
inferred← citeshttps://doi.org/10.1007/978-3-031-15802-5_10openalex-snapshot
Quantum Commitments and Signatures Without One-Way Functions
inferred← citeshttps://doi.org/10.1007/978-3-031-22365-5_16openalex-snapshot
Round-Optimal Black-Box Secure Computation from Two-Round Malicious OT
inferred← citeshttps://doi.org/10.1007/978-3-031-22912-1_25openalex-snapshot
Quantum Attacks on PRFs Based on Public Random Permutations
inferred← citeshttps://doi.org/10.1007/978-3-031-25659-2_1openalex-snapshot
Collision-Resistant and Pseudorandom Hash Function Using Tweakable Block Cipher
inferred← citeshttps://doi.org/10.1007/978-3-031-38545-2_23openalex-snapshot
Improved Multi-user Security Using the Squared-Ratio Method
inferred← citeshttps://doi.org/10.1007/978-3-031-38548-3_21openalex-snapshot
Revisiting the Indifferentiability of the Sum of Permutations
inferred← citeshttps://doi.org/10.1007/978-3-031-38554-4_3openalex-snapshot
Cloning Games: A General Framework for Unclonable Primitives
inferred← citeshttps://doi.org/10.1007/978-3-031-38554-4_8openalex-snapshot
Secure Computation with Shared EPR Pairs (Or: How to Teleport in Zero-Knowledge)
inferred← citeshttps://doi.org/10.1007/978-3-031-40003-2_16openalex-snapshot
Non-Observable Quantum Random Oracle Model
inferred← citeshttps://doi.org/10.1007/978-3-031-48624-1_8openalex-snapshot
Public-Key Encryption with Quantum Keys
inferred← citeshttps://doi.org/10.1007/978-3-031-61140-7_28openalex-snapshot
Comparison of an Accelerated Garble Embedding Methodology for Privacy Preserving in Biomedical Data Analytics
inferred← citeshttps://doi.org/10.1007/978-3-031-68385-5_15openalex-snapshot
Information-Theoretic Security with Asymmetries
inferred← citeshttps://doi.org/10.1007/978-3-031-68394-7_4openalex-snapshot
Quantum Public-Key Encryption with Tamper-Resilient Public Keys from One-Way Functions
inferred← citeshttps://doi.org/10.1007/978-3-031-92916-8_27openalex-snapshot
Taler: Balancing Accountability and Privacy in Electronic Payments
inferred← citeshttps://doi.org/10.1007/978-3-032-35367-2_7openalex-snapshot
Unique SNARGs with Adaptive Security: Constructions and Black-Box Separations
inferred← citeshttps://doi.org/10.1007/978-3-319-28166-7_30openalex-snapshot
On the XOR of Multiple Random Permutations
inferred← citeshttps://doi.org/10.1007/978-3-319-59879-6_21openalex-snapshot
XOR of PRPs in a Quantum World
inferred← citeshttps://doi.org/10.1007/978-3-319-63697-9_19openalex-snapshot
Encrypted Davies-Meyer and Its Dual: Towards Optimal Security Using Mirror Theory
inferred← citeshttps://doi.org/10.1007/978-3-540-24638-1_21openalex-snapshot
Computational Collapse of Quantum State with Application to Oblivious Transfer
inferred← citeshttps://doi.org/10.1007/978-3-642-19571-6_35openalex-snapshot
Towards Non-Black-Box Lower Bounds in Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-642-20465-4_29openalex-snapshot
Key-Dependent Message Security: Generic Amplification and Completeness
inferred← citeshttps://doi.org/10.1007/978-3-642-25405-5_17openalex-snapshot
A New Spin on Quantum Cryptography: Avoiding Trapdoors and Embracing Public Keys
inferred← citeshttps://doi.org/10.1007/978-3-642-36594-2_19openalex-snapshot
Unprovable Security of Perfect NIZK and Non-interactive Non-malleable Commitments
inferred← citeshttps://doi.org/10.1007/978-3-662-44371-2_7openalex-snapshot
The Exact PRF-Security of NMAC and HMAC
inferred← citeshttps://doi.org/10.1007/978-3-662-44803-8_24openalex-snapshot
On the Impossibility of Black-Box Transformations in Mechanism Design
inferred← citeshttps://doi.org/10.1007/978-3-662-46494-6_15openalex-snapshot
Resettably Sound Zero-Knowledge Arguments from OWFs - The (Semi) Black-Box Way
inferred← citeshttps://doi.org/10.1007/978-3-662-46800-5_26openalex-snapshot
More Efficient Oblivious Transfer Extensions with Security for Malicious Adversaries
inferred← citeshttps://doi.org/10.1007/978-3-662-46803-6_8openalex-snapshot
Two Halves Make a Whole
inferred← citeshttps://doi.org/10.1007/978-3-662-48800-3_8openalex-snapshot
On Black-Box Complexity of Universally Composable Security in the CRS Model
inferred← citeshttps://doi.org/10.1007/978-3-662-53008-5_19openalex-snapshot
On Statistically Secure Obfuscation with Approximate Correctness
inferred← citeshttps://doi.org/10.1007/978-3-662-53015-3_15openalex-snapshot
Linicrypt: A Model for Practical Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-662-53015-3_19openalex-snapshot
Fine-Grained Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-662-53641-4_19openalex-snapshot
Secure Multiparty RAM Computation in Constant Rounds
inferred← citeshttps://doi.org/10.1007/978-3-662-53641-4_8openalex-snapshot
Pseudoentropy: Lower-Bounds for Chain Rules and Transformations
inferred← citeshttps://doi.org/10.1007/978-981-95-5116-3_8openalex-snapshot
Laconic Cryptography with Preprocessing
inferred← citeshttps://doi.org/10.1007/978-981-96-0954-3_8openalex-snapshot
Ideal Public Key Encryption, Revisited
inferred← citeshttps://doi.org/10.1007/978-981-96-4734-7_23openalex-snapshot
Quantum Public-Key Encryption of Quantum States, and More
inferred← citeshttps://doi.org/10.1007/978-981-96-9095-4_8openalex-snapshot
Indifferentiability Separations in Ideal Public Key Encryption: Explicit vs. Implicit Rejection
inferred← citeshttps://doi.org/10.1007/978-981-99-8742-9_2openalex-snapshot
On the (Im)plausibility of Public-Key Quantum Money from Collision-Resistant Hash Functions
inferred← citeshttps://doi.org/10.1007/bfb0052231openalex-snapshot
Public-key cryptosystems from lattice reduction problems
inferred← citeshttps://doi.org/10.1007/s00037-016-0122-2openalex-snapshot
Unprovable Security of Perfect NIZK and Non-interactive Non-malleable Commitments
inferred← citeshttps://doi.org/10.1007/s00145-004-0102-6openalex-snapshot
Computationally Secure Oblivious Transfer
inferred← citeshttps://doi.org/10.1007/s00145-005-0317-1openalex-snapshot
The Impossibility of Basing One-Way Permutations on Central Cryptographic Primitives
inferred← citeshttps://doi.org/10.1007/s00145-006-0233-zopenalex-snapshot
Session-Key Generation Using Human Passwords Only
inferred← citeshttps://doi.org/10.1007/s00145-006-0346-4openalex-snapshot
Completeness in Two-Party Secure Computation: A Computational View
inferred← citeshttps://doi.org/10.1007/s00145-006-0438-1openalex-snapshot
Constant-Round Oblivious Transfer in the Bounded Storage Model
inferred← citeshttps://doi.org/10.1007/s00145-016-9236-6openalex-snapshot
More Efficient Oblivious Transfer Extensions
inferred← citeshttps://doi.org/10.1007/s00145-019-09326-yopenalex-snapshot
On Black-Box Complexity of Universally Composable Security in the CRS Model
inferred← citeshttps://doi.org/10.1007/s00145-024-09518-1openalex-snapshot
On Building Fine-Grained One-Way Functions from Strong Average-Case Hardness
inferred← citeshttps://doi.org/10.1007/s00224-014-9545-9openalex-snapshot
Cryptography and Algorithmic Randomness
inferred← citeshttps://doi.org/10.1016/j.csi.2003.12.001openalex-snapshot
A novel three-party encrypted key exchange protocol
inferred← citeshttps://doi.org/10.1016/j.csi.2007.08.018openalex-snapshot
Improving the novel three-party encrypted key exchange protocol
inferred← citeshttps://doi.org/10.1016/j.csi.2009.03.002openalex-snapshot
Cryptanalysis of two three-party encrypted key exchange protocols
inferred← citeshttps://doi.org/10.1017/s0963548310000465openalex-snapshot
The Dual BKR Inequality and Rudich's Conjecture
inferred← citeshttps://doi.org/10.1109/cns62487.2024.10735569openalex-snapshot
Device-independent Tokens with Password Protection Against Token Stealing
inferred← citeshttps://doi.org/10.1109/focs.2012.51openalex-snapshot
Constructing a Pseudorandom Generator Requires an Almost Linear Number of Calls
inferred← citeshttps://doi.org/10.1109/focs.2015.22openalex-snapshot
Black-Box Garbled RAM
inferred← citeshttps://doi.org/10.1137/100790537openalex-snapshot
Black-Box Constructions of Protocols for Secure Computation
inferred← citeshttps://doi.org/10.1145/1132516.1132531openalex-snapshot
Black-box constructions for secure computation
inferred← citeshttps://doi.org/10.1145/168588.168596openalex-snapshot
Random oracles are practical
inferred← citeshttps://doi.org/10.1145/1993636.1993652openalex-snapshot
Limits of provable security from standard assumptions
inferred← citeshttps://doi.org/10.1145/237814.237996openalex-snapshot
Correlated pseudorandomness and the complexity of private computations
inferred← citeshttps://doi.org/10.1145/3243734.3243839openalex-snapshot
PASTA
inferred← citeshttps://doi.org/10.1145/3618260.3649654openalex-snapshot
Commitments from Quantum One-Wayness
inferred← citeshttps://doi.org/10.1360/ssi-2022-0434openalex-snapshot
Privacy-preserving cryptographic algorithms and protocols: a survey on designs and applications
inferred← citeshttps://doi.org/10.14569/ijacsa.2014.050222openalex-snapshot
Complexity of Network Design for Private Communication and the P-vs-NP Question
inferred← citeshttps://doi.org/10.14722/ndss.2017.23097openalex-snapshot
Pushing the Communication Barrier in Secure Computation using Lookup Tables
inferred← citeshttps://doi.org/10.14722/ndss.2024.23380openalex-snapshot
MPCDiff: Testing and Repairing MPC-Hardened Deep Learning Models
inferred← citeshttps://doi.org/10.1515/jmc-2023-0028openalex-snapshot
On the Black-Box impossibility of multi-designated verifiers signature schemes from ring signature schemes
inferred← citeshttps://doi.org/10.26083/tuprints-00006019openalex-snapshot
Quantum Security of Cryptographic Primitives
inferred← citeshttps://doi.org/10.32657/10356/47992openalex-snapshot
A study of private information retrieval and related primitives.
inferred← citeshttps://doi.org/10.46298/theoretics.23.10openalex-snapshot
The Complexity of Iterated Reversible Computation
inferred← citeshttps://doi.org/10.46586/tches.v2020.i2.327-357openalex-snapshot
On the Security Goals of White-Box Cryptography
inferred← citeshttps://doi.org/10.46586/tosc.v2017.i3.228-252openalex-snapshot
Optimal PRFs from Blockcipher Designs
inferred← citeshttps://doi.org/10.46586/tosc.v2023.i2.1-46openalex-snapshot
Understanding the Duplex and Its Security
inferred← citeshttps://doi.org/10.5040/9780755625963.0007openalex-snapshot
Chapter Notes and References
inferred← citeshttps://doi.org/10.62056/a3waksuc2openalex-snapshot
On TRP-RF Switch in the Quantum Query Model
inferred← citeshttps://doi.org/10.62056/anxra6qiuopenalex-snapshot
Understanding and Simplifying the UK NCSC Modes GLEVIAN and VIGORNIAN
inferred← citeshttps://doi.org/10.70675/8c73171dze00bz499az92a3z44b4d1a55c04openalex-snapshot
Experimental demonstration of quantum advantage for computing and communication tasks
inferred← citeshttps://doi.org/10.7146/brics.v10i3.21774openalex-snapshot
On the Computational Collapse of Quantum Information
inferred← citeshttps://doi.org/10.7146/brics.v10i37.21805openalex-snapshot
Computational Collapse of Quantum State with Application to Oblivious Transfer
inferred← citeshttps://doi.org/10.7146/brics.v7i52.20219openalex-snapshot
How to Convert a Flavor of Quantum Bit Commitment
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.