On the public citation graph
Finding collisions on a one-way street: Can secure hash functions be based on general assumptions?
0 signed · 238 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.1007/0-387-34805-0_39openalex-snapshot
A Design Principle for Hash Functions
inferredcites →https://doi.org/10.1007/0-387-34805-0_40openalex-snapshot
One Way Hash Functions and DES
inferredcites →https://doi.org/10.1007/3-540-38424-3_21openalex-snapshot
Structural Properties of One-Way Hash Functions
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-48071-4_30openalex-snapshot
Necessary and Sufficient Conditions for Collision-Free Hashing
inferredcites →https://doi.org/10.1007/3-540-68339-9_27openalex-snapshot
Foiling Birthday Attacks in Length-Doubling Transformations
inferredcites →https://doi.org/10.1007/3-540-69710-1_11openalex-snapshot
New Constructions for Secure Hash Functions
inferredcites →https://doi.org/10.1007/bf00190757openalex-snapshot
Necessary and sufficient conditions for collision-free hashing
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/141809.141812openalex-snapshot
Message authentication with one-way hash 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.1002/sec.1457openalex-snapshot
A limitation on security evaluation of cryptographic primitives with fixed keys
inferred← citeshttps://doi.org/10.1007/0-387-23483-7_447openalex-snapshot
Universal One-Way Hash Functions
inferred← citeshttps://doi.org/10.1007/11426639_31openalex-snapshot
On the Impossibility of Highly-Efficient Blockcipher-Based Hash Functions
inferred← citeshttps://doi.org/10.1007/11535218_27openalex-snapshot
On the Generic Insecurity of the Full Domain Hash
inferred← citeshttps://doi.org/10.1007/11586821_8openalex-snapshot
Hash Based Digital Signature Schemes
inferred← citeshttps://doi.org/10.1007/11596219_6openalex-snapshot
How to Construct Universal One-Way Hash Functions of Order r
inferred← citeshttps://doi.org/10.1007/11745853_10openalex-snapshot
Collision-Resistant No More: Hash-and-Sign Paradigm Revisited
inferred← citeshttps://doi.org/10.1007/11767480_4openalex-snapshot
Do Broken Hash Functions Affect the Security of Time-Stamping Schemes?
inferred← citeshttps://doi.org/10.1007/11799313_21openalex-snapshot
The Ideal-Cipher Model, Revisited: An Uninstantiable Blockcipher-Based Hash Function
inferred← citeshttps://doi.org/10.1007/11818175_3openalex-snapshot
Strengthening Digital Signatures Via Randomized Hashing
inferred← citeshttps://doi.org/10.1007/3-540-36178-2_7openalex-snapshot
On the Impossibilities of Basing One-Way Permutations on Central Cryptographic Primitives
inferred← citeshttps://doi.org/10.1007/3-540-36413-7_5openalex-snapshot
On the Power of Claw-Free Permutations
inferred← citeshttps://doi.org/10.1007/3-540-36492-7_22openalex-snapshot
Secure Block Ciphers Are Not Sufficient for One-Way Hash Functions in the Preneel-Govaerts-Vandewalle Model
inferred← citeshttps://doi.org/10.1007/3-540-39200-9_19openalex-snapshot
Concealment and Its Applications to Authenticated Encryption
inferred← citeshttps://doi.org/10.1007/3-540-44987-6_11openalex-snapshot
Hash Functions: From Merkle-Damgård to Shoup
inferred← citeshttps://doi.org/10.1007/3-540-45539-6_32openalex-snapshot
A Composition Theorem for Universal One-Way Hash Functions
inferred← citeshttps://doi.org/10.1007/3-540-45760-7_7openalex-snapshot
On the Impossibility of Constructing Non-interactive Statistically-Secret Protocols from Any Trapdoor One-Way Function
inferred← citeshttps://doi.org/10.1007/3-540-46035-7_6openalex-snapshot
On the Security of Joint Signature and Encryption
inferred← citeshttps://doi.org/10.1007/3-540-48969-x_8openalex-snapshot
The State of Cryptographic Hash Functions
inferred← citeshttps://doi.org/10.1007/3-540-49162-7_7openalex-snapshot
A Relationship between One-Wayness and Correlation Intractability
inferred← citeshttps://doi.org/10.1007/3-540-49248-8_3openalex-snapshot
Cryptographic Primitives for Information Authentication — State of the Art
inferred← citeshttps://doi.org/10.1007/978-3-030-03807-6_16openalex-snapshot
Injective Trapdoor Functions via Derandomization: How Strong is Rudich’s Black-Box Barrier?
inferred← citeshttps://doi.org/10.1007/978-3-030-03807-6_17openalex-snapshot
Enhancements are Blackbox Non-trivial: Impossibility of Enhanced Trapdoor Permutations from Standard Trapdoor Permutations
inferred← citeshttps://doi.org/10.1007/978-3-030-17253-4_18openalex-snapshot
Upper and Lower Bounds for Continuous Non-Malleable Codes
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-17659-4_23openalex-snapshot
Distributional Collision Resistance Beyond One-Way Functions
inferred← citeshttps://doi.org/10.1007/978-3-030-36030-6_17openalex-snapshot
On the Complexity of Collision Resistant Hash Functions: New and Old Black-Box Separations
inferred← citeshttps://doi.org/10.1007/978-3-030-45374-9_19openalex-snapshot
On Black-Box Extensions of Non-interactive Zero-Knowledge Arguments, and Signatures Directly from Simulation Soundness
inferred← citeshttps://doi.org/10.1007/978-3-030-56880-1_21openalex-snapshot
Black-Box Use of One-Way Functions is Useless for Optimal Fair Coin-Tossing
inferred← citeshttps://doi.org/10.1007/978-3-030-64381-2_22openalex-snapshot
On Average-Case Hardness in $$\mathsf {TFNP}$$ from One-Way Functions
inferred← citeshttps://doi.org/10.1007/978-3-030-64837-4_1openalex-snapshot
Finding Collisions in a Quantum World: Quantum Black-Box Separation of Collision-Resistance and One-Wayness
inferred← citeshttps://doi.org/10.1007/978-3-030-71522-9_624openalex-snapshot
Universal One-Way Hash Functions (UOWHF)
inferred← citeshttps://doi.org/10.1007/978-3-030-84245-1_2openalex-snapshot
Computational Hardness of Optimal Fair Computation: Beyond Minicrypt
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-90453-1_19openalex-snapshot
The Cost of Adaptivity in Security Games on Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-97131-1_5openalex-snapshot
Lifting Standard Model Reductions to Common Setup Assumptions
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-15982-4_17openalex-snapshot
Collision-Resistance from Multi-Collision-Resistance
inferred← citeshttps://doi.org/10.1007/978-3-031-15982-4_19openalex-snapshot
The Gap Is Sensitive to Size of Preimages: Collapsing Property Doesn’t Go Beyond Quantum Collision-Resistance for Preimages Bounded Hash Functions
inferred← citeshttps://doi.org/10.1007/978-3-031-15982-4_9openalex-snapshot
Low Communication Complexity Protocols, Collision Resistant Hash Functions and Secret Key-Agreement Protocols
inferred← citeshttps://doi.org/10.1007/978-3-031-22365-5_10openalex-snapshot
On the Impossibility of Algebraic Vector Commitments in Pairing-Free Groups
inferred← citeshttps://doi.org/10.1007/978-3-031-30634-1_14openalex-snapshot
Impossibility of Indifferentiable Iterated Blockciphers from 3 or Less Primitive Calls
inferred← citeshttps://doi.org/10.1007/978-3-031-38551-3_22openalex-snapshot
On the Impossibility of Algebraic NIZK in Pairing-Free Groups
inferred← citeshttps://doi.org/10.1007/978-3-031-38554-4_4openalex-snapshot
Publicly-Verifiable Deletion via Target-Collapsing Functions
inferred← citeshttps://doi.org/10.1007/978-3-031-48621-0_8openalex-snapshot
Searching for ELFs in the Cryptographic Forest
inferred← citeshttps://doi.org/10.1007/978-3-031-58737-5_5openalex-snapshot
Public-Coin, Complexity-Preserving, Succinct Arguments of Knowledge for NP from Collision-Resistance
inferred← citeshttps://doi.org/10.1007/978-3-031-68379-4_11openalex-snapshot
Limits of Black-Box Anamorphic Encryption
inferred← citeshttps://doi.org/10.1007/978-3-031-68388-6_15openalex-snapshot
Collision Resistance from Multi-collision Resistance for All Constant Parameters
inferred← citeshttps://doi.org/10.1007/978-3-031-68403-6_1openalex-snapshot
Constant-Round Arguments for Batch-Verification and Bounded-Space Computations from One-Way Functions
inferred← citeshttps://doi.org/10.1007/978-3-031-78020-2_13openalex-snapshot
From One-Time to Two-Round Reusable Multi-signatures Without Nested Forking
inferred← citeshttps://doi.org/10.1007/978-3-031-91124-8_10openalex-snapshot
Generic Anamorphic Encryption, Revisited: New Limitations and Constructions
inferred← citeshttps://doi.org/10.1007/978-3-031-91134-7_9openalex-snapshot
Instance Compression, Revisited
inferred← citeshttps://doi.org/10.1007/978-3-032-12290-2_8openalex-snapshot
Separating Pseudorandom Codes from Local Oracles
inferred← citeshttps://doi.org/10.1007/978-3-032-35367-2_4openalex-snapshot
On the Complexity of Interactive Arguments
inferred← citeshttps://doi.org/10.1007/978-3-319-12475-9_7openalex-snapshot
Forward-Secure Sequential Aggregate Message Authentication Revisited
inferred← citeshttps://doi.org/10.1007/978-3-319-16715-2_15openalex-snapshot
Hash Functions from Defective Ideal Ciphers
inferred← citeshttps://doi.org/10.1007/978-3-319-56614-6_19openalex-snapshot
Toward Fine-Grained Blackbox Separations Between Semantic and Circular-Security Notions
inferred← citeshttps://doi.org/10.1007/978-3-319-63688-7_23openalex-snapshot
Structure vs. Hardness Through the Obfuscation Lens
inferred← citeshttps://doi.org/10.1007/978-3-319-70503-3_25openalex-snapshot
Can PPAD Hardness be Based on Standard Cryptographic Assumptions?
inferred← citeshttps://doi.org/10.1007/978-3-319-75160-3_5openalex-snapshot
From Attack on Feige-Shamir to Construction of Oblivious Transfer
inferred← citeshttps://doi.org/10.1007/978-3-319-78375-8_5openalex-snapshot
Multi-Collision Resistant Hash Functions and Their Applications
inferred← citeshttps://doi.org/10.1007/978-3-319-78375-8_6openalex-snapshot
Collision Resistant Hashing for Paranoids: Dealing with Multiple Collisions
inferred← citeshttps://doi.org/10.1007/978-3-319-78381-9_2openalex-snapshot
On the Gold Standard for Security of Universal Steganography
inferred← citeshttps://doi.org/10.1007/978-3-319-96881-0_10openalex-snapshot
Combiners for Backdoored Random Oracles
inferred← citeshttps://doi.org/10.1007/978-3-319-96881-0_11openalex-snapshot
On Distributional Collision Resistant Hashing
inferred← citeshttps://doi.org/10.1007/978-3-540-24638-1_1openalex-snapshot
Notions of Reducibility between Cryptographic Primitives
inferred← citeshttps://doi.org/10.1007/978-3-540-24676-3_12openalex-snapshot
Black-Box Composition Does Not Imply Adaptive Security
inferred← citeshttps://doi.org/10.1007/978-3-540-24691-6_8openalex-snapshot
Yet Another Definition of Weak Collision Resistance and Its Analysis
inferred← citeshttps://doi.org/10.1007/978-3-540-27800-9_19openalex-snapshot
A Generalization of PGV-Hash Functions and Security Analysis in Black-Box Model
inferred← citeshttps://doi.org/10.1007/978-3-540-28628-8_6openalex-snapshot
Finding Collisions on a Public Road, or Do Secure Hash Functions Need Secret Coins?
inferred← citeshttps://doi.org/10.1007/978-3-540-30539-2_14openalex-snapshot
Masking Based Domain Extenders for UOWHFs: Bounds and Constructions
inferred← citeshttps://doi.org/10.1007/978-3-540-30539-2_15openalex-snapshot
Higher Order Universal One-Way Hash Functions
inferred← citeshttps://doi.org/10.1007/978-3-540-30539-2_35openalex-snapshot
On Provably Secure Time-Stamping Schemes
inferred← citeshttps://doi.org/10.1007/978-3-540-30556-9_26openalex-snapshot
Impossibility of Construction of OWHF and UOWHF from PGV Model Based on Block Cipher Secure Against ACPCA
inferred← citeshttps://doi.org/10.1007/978-3-540-30564-4_24openalex-snapshot
A Sufficient Condition for Optimal Domain Extension of UOWHFs
inferred← citeshttps://doi.org/10.1007/978-3-540-30576-7_24openalex-snapshot
Sufficient Conditions for Collision-Resistant Hashing
inferred← citeshttps://doi.org/10.1007/978-3-540-40061-5_13openalex-snapshot
New Parallel Domain Extenders for UOWHF
inferred← citeshttps://doi.org/10.1007/978-3-540-45146-4_9openalex-snapshot
Extending Oblivious Transfers Efficiently
inferred← citeshttps://doi.org/10.1007/978-3-540-68914-0_10openalex-snapshot
Getting the Best Out of Existing Hash Functions; or What if We Are Stuck with SHA?
inferred← citeshttps://doi.org/10.1007/978-3-540-70936-7_23openalex-snapshot
One-Way Permutations, Interactive Hashing and Statistically Hiding Commitments
inferred← citeshttps://doi.org/10.1007/978-3-540-70936-7_24openalex-snapshot
Towards a Separation of Semantic and CCA Security for Public Key Encryption
inferred← citeshttps://doi.org/10.1007/978-3-540-72540-4_2openalex-snapshot
Non-trivial Black-Box Combiners for Collision-Resistant Hash-Functions Don’t Exist
inferred← citeshttps://doi.org/10.1007/978-3-540-72540-4_31openalex-snapshot
Feistel Networks Made Public, and Applications
inferred← citeshttps://doi.org/10.1007/978-3-540-74143-5_15openalex-snapshot
Amplifying Collision Resistance: A Complexity-Theoretic Treatment
inferred← citeshttps://doi.org/10.1007/978-3-540-75670-5_5openalex-snapshot
A CDH-Based Strongly Unforgeable Signature Without Collision Resistant Hash Function
inferred← citeshttps://doi.org/10.1007/978-3-540-75670-5_9openalex-snapshot
Does Secure Time-Stamping Imply Collision-Free Hash Functions?
inferred← citeshttps://doi.org/10.1007/978-3-540-78524-8_25openalex-snapshot
A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval
inferred← citeshttps://doi.org/10.1007/978-3-540-78967-3_12openalex-snapshot
A New Mode of Operation for Block Ciphers and Length-Preserving MACs
inferred← citeshttps://doi.org/10.1007/978-3-540-85174-5_23openalex-snapshot
Compression from Collisions, or Why CRHF Combiners Have a Long Output
inferred← citeshttps://doi.org/10.1007/978-3-540-88733-1_18openalex-snapshot
Can We Construct Unbounded Time-Stamping Schemes from Collision-Free Hash Functions?
inferred← citeshttps://doi.org/10.1007/978-3-540-89255-7_17openalex-snapshot
How to Fill Up Merkle-Damgård Hash Functions
inferred← citeshttps://doi.org/10.1007/978-3-540-89255-7_9openalex-snapshot
Hash Functions from Sigma Protocols and Improvements to VSH
inferred← citeshttps://doi.org/10.1007/978-3-540-89411-7_8openalex-snapshot
Concealment and Its Applications to Authenticated Encryption
inferred← citeshttps://doi.org/10.1007/978-3-540-89641-8_15openalex-snapshot
Black-Box Constructions for Fully-Simulatable Oblivious Transfer Protocols
inferred← citeshttps://doi.org/10.1007/978-3-642-00306-6_13openalex-snapshot
Pseudorandom-Function Property of the Step-Reduced Compression Functions of SHA-256 and SHA-512
inferred← citeshttps://doi.org/10.1007/978-3-642-00457-5_12openalex-snapshot
Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer
inferred← citeshttps://doi.org/10.1007/978-3-642-00457-5_13openalex-snapshot
On the (Im)Possibility of Key Dependent Encryption
inferred← citeshttps://doi.org/10.1007/978-3-642-00457-5_24openalex-snapshot
Black-Box Constructions of Two-Party Protocols from One-Way Functions
inferred← citeshttps://doi.org/10.1007/978-3-642-00457-5_25openalex-snapshot
Chosen-Ciphertext Security via Correlated Products
inferred← citeshttps://doi.org/10.1007/978-3-642-01001-9_1openalex-snapshot
Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
inferred← citeshttps://doi.org/10.1007/978-3-642-01001-9_22openalex-snapshot
Salvaging Merkle-Damgård for Practical Applications
inferred← citeshttps://doi.org/10.1007/978-3-642-01001-9_23openalex-snapshot
On the Security of Padding-Based Encryption Schemes – or – Why We Cannot Prove OAEP Secure in the Standard Model
inferred← citeshttps://doi.org/10.1007/978-3-642-03317-9_20openalex-snapshot
Enhanced Target Collision Resistant Hash Functions Revisited
inferred← citeshttps://doi.org/10.1007/978-3-642-03356-8_16openalex-snapshot
Message Authentication Codes from Unpredictable Block Ciphers
inferred← citeshttps://doi.org/10.1007/978-3-642-04642-1_19openalex-snapshot
Oracle Separation in the Non-uniform Model
inferred← citeshttps://doi.org/10.1007/978-3-642-10366-7_9openalex-snapshot
MD5 Is Weaker Than Weak: Attacks on Concatenated Combiners
inferred← citeshttps://doi.org/10.1007/978-3-642-11799-2_11openalex-snapshot
Two Is a Crowd? A Black-Box Separation of One-Wayness and Security under Correlated Inputs
inferred← citeshttps://doi.org/10.1007/978-3-642-11799-2_35openalex-snapshot
Private Coins versus Public Coins in Zero-Knowledge Proof Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-11925-5_1openalex-snapshot
The First 30 Years of Cryptographic Hash Functions and the NIST SHA-3 Competition
inferred← citeshttps://doi.org/10.1007/978-3-642-13190-5_10openalex-snapshot
On the Impossibility of Three-Move Blind Signature Schemes
inferred← citeshttps://doi.org/10.1007/978-3-642-13858-4_9openalex-snapshot
Domain Extension for Enhanced Target Collision-Resistant Hash Functions
inferred← citeshttps://doi.org/10.1007/978-3-642-14081-5_20openalex-snapshot
Optimally Tight Security Proofs for Hash-Then-Publish Time-Stamping
inferred← citeshttps://doi.org/10.1007/978-3-642-14712-8_12openalex-snapshot
On the Round Complexity of Zero-Knowledge Proofs Based on One-Way Permutations
inferred← citeshttps://doi.org/10.1007/978-3-642-19379-8_22openalex-snapshot
On the Impossibility of Instantiating PSS in the Standard Model
inferred← citeshttps://doi.org/10.1007/978-3-642-19571-6_34openalex-snapshot
Limits on the Power of Zero-Knowledge Proofs in Cryptographic Constructions
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-19571-6_36openalex-snapshot
On Black-Box Separations among Injective One-Way Functions
inferred← citeshttps://doi.org/10.1007/978-3-642-25385-0_34openalex-snapshot
Separating Short Structure-Preserving Signatures from Non-interactive Assumptions
inferred← citeshttps://doi.org/10.1007/978-3-642-27739-9_624-2openalex-snapshot
Universal One-Way Hash Functions (UOWHF)
inferred← citeshttps://doi.org/10.1007/978-3-642-28914-9_36openalex-snapshot
Uniqueness Is a Different Story: Impossibility of Verifiable Random Functions from Trapdoor Permutations
inferred← citeshttps://doi.org/10.1007/978-3-642-30057-8_6openalex-snapshot
Strong Security from Probabilistic Signature Schemes
inferred← citeshttps://doi.org/10.1007/978-3-642-31410-0_26openalex-snapshot
Black-Box Reductions and Separations in Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-642-31448-3_23openalex-snapshot
Adaptive CCA Broadcast Encryption with Constant-Size Secret Keys and Ciphertexts
inferred← citeshttps://doi.org/10.1007/978-3-642-32009-5_41openalex-snapshot
The Curious Case of Non-Interactive Commitments – On the Power of Black-Box vs. Non-Black-Box Use of Primitives
inferred← citeshttps://doi.org/10.1007/978-3-642-32009-5_47openalex-snapshot
On the Impossibility of Constructing Efficient Key Encapsulation and Programmable Hash Functions in Prime Order Groups
inferred← citeshttps://doi.org/10.1007/978-3-642-33272-2_7openalex-snapshot
Deterministic Random Oracles
inferred← citeshttps://doi.org/10.1007/978-3-642-34961-4_11openalex-snapshot
The Generalized Randomized Iterate and Its Application to New Efficient Constructions of UOWHFs from Regular One-Way Functions
inferred← citeshttps://doi.org/10.1007/978-3-642-36594-2_25openalex-snapshot
Limits on the Usefulness of Random Oracles
inferred← citeshttps://doi.org/10.1007/978-3-642-36594-2_37openalex-snapshot
A Cookbook for Black-Box Separations and a Recipe for UOWHFs
inferred← citeshttps://doi.org/10.1007/978-3-642-38348-9_26openalex-snapshot
Ideal-Cipher (Ir)reducibility for Blockcipher-Based Hash Functions
inferred← citeshttps://doi.org/10.1007/978-3-642-39059-3_11openalex-snapshot
Black-Box Separations and Their Adaptability to the Non-uniform Model
inferred← citeshttps://doi.org/10.1007/978-3-642-42033-7_16openalex-snapshot
Notions of Black-Box Reductions, Revisited
inferred← citeshttps://doi.org/10.1007/978-3-642-54242-8_11openalex-snapshot
On the Power of Public-Key Encryption in Secure Computation
inferred← citeshttps://doi.org/10.1007/978-3-662-46497-7_8openalex-snapshot
Primary-Secondary-Resolver Membership Proof Systems
inferred← citeshttps://doi.org/10.1007/978-3-662-48000-7_9openalex-snapshot
Parallel Hashing via List Recoverability
inferred← citeshttps://doi.org/10.1007/978-3-662-49096-9_15openalex-snapshot
Homomorphic Evaluation Requires Depth
inferred← citeshttps://doi.org/10.1007/978-3-662-49099-0_19openalex-snapshot
On Constructing One-Way Permutations from Indistinguishability Obfuscation
inferred← citeshttps://doi.org/10.1007/978-3-662-49387-8_12openalex-snapshot
Very-Efficient Simulatable Flipping of Many Coins into a Well
inferred← citeshttps://doi.org/10.1007/978-3-662-49896-5_9openalex-snapshot
On the Power of Hierarchical Identity-Based Encryption
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-3-662-53644-5_7openalex-snapshot
Towards Non-Black-Box Separations of Public Key Encryption and One Way Function
inferred← citeshttps://doi.org/10.1007/978-3-662-53890-6_30openalex-snapshot
Indistinguishable Proofs of Work or Knowledge
inferred← citeshttps://doi.org/10.1007/978-981-96-1218-5_21openalex-snapshot
Improving Hash-Based Signature Schemes: From Theory to Practice
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/s00145-005-0317-1openalex-snapshot
The Impossibility of Basing One-Way Permutations on Central Cryptographic Primitives
inferred← citeshttps://doi.org/10.1007/s00145-008-9030-1openalex-snapshot
On the Impossibility of Highly-Efficient Blockcipher-Based Hash Functions
inferred← citeshttps://doi.org/10.1007/s00145-010-9066-xopenalex-snapshot
Possibility and Impossibility Results for Selective Decommitments
inferred← citeshttps://doi.org/10.1007/s00145-010-9071-0openalex-snapshot
An Analysis of the Blockcipher-Based Hash Functions from PGV
inferred← citeshttps://doi.org/10.1007/s00145-010-9072-zopenalex-snapshot
Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer
inferred← citeshttps://doi.org/10.1007/s00145-013-9155-8openalex-snapshot
A Characterization of Chameleon Hash Functions and New, Efficient Designs
inferred← citeshttps://doi.org/10.1007/s00145-014-9194-9openalex-snapshot
Limits on the Usefulness of Random Oracles
inferred← citeshttps://doi.org/10.1007/s00145-017-9268-6openalex-snapshot
On Constructing One-Way Permutations from Indistinguishability Obfuscation
inferred← citeshttps://doi.org/10.1007/s00145-021-09405-zopenalex-snapshot
Injective Trapdoor Functions via Derandomization: How Strong is Rudich’s Black-Box Barrier?
inferred← citeshttps://doi.org/10.1007/s00145-024-09495-5openalex-snapshot
Collision Resistance from Multi-collision Resistance
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/s10207-013-0190-0openalex-snapshot
Adaptive CCA broadcast encryption with constant-size secret keys and ciphertexts
inferred← citeshttps://doi.org/10.1007/s10623-003-6154-zopenalex-snapshot
Generic Groups, Collision Resistance, and ECDSA
inferred← citeshttps://doi.org/10.1007/s10623-005-6344-yopenalex-snapshot
Some Observations on the Theory of Cryptographic Hash Functions
inferred← citeshttps://doi.org/10.1007/s10623-015-0096-0openalex-snapshot
Open problems in hash function security
inferred← citeshttps://doi.org/10.1007/s10623-022-01008-4openalex-snapshot
On subset-resilient hash function families
inferred← citeshttps://doi.org/10.1016/j.comnet.2014.07.010openalex-snapshot
On the anonymity of two-factor authentication schemes for wireless sensor networks: Attacks, principle and solutions
inferred← citeshttps://doi.org/10.1016/j.csi.2008.09.019openalex-snapshot
Strong unforgeability in group signature schemes
inferred← citeshttps://doi.org/10.1016/j.dam.2007.05.005openalex-snapshot
Construction of universal one-way hash functions: Tree hashing revisited
inferred← citeshttps://doi.org/10.1016/j.jcss.2010.06.007openalex-snapshot
Infeasibility of instance compression and succinct PCPs for NP
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.10.021openalex-snapshot
Bounds on the efficiency of black-box commitment schemes
inferred← citeshttps://doi.org/10.1017/cbo9781139013673openalex-snapshot
Cryptography and Secure Communication
inferred← citeshttps://doi.org/10.1093/ietfec/e88-a.1.33openalex-snapshot
Weak Security Notions of Cryptographic Unkeyed Hash Functions and Their Amplifiability
inferred← citeshttps://doi.org/10.1093/ietfec/e88-a.1.39openalex-snapshot
PGV-Style Block-Cipher-Based Hash Families and Black-Box Analysis
inferred← citeshttps://doi.org/10.1093/ietfec/e88-a.1.49openalex-snapshot
Construction of UOWHF: Two New Parallel Methods
inferred← citeshttps://doi.org/10.1093/ietfec/e91-a.1.64openalex-snapshot
Classification of Hash Functions Suitable for Real-Life Systems
inferred← citeshttps://doi.org/10.1093/ietfec/e91-a.1.74openalex-snapshot
Collision Resistance of Double-Block-Length Hash Function against Free-Start Attack
inferred← citeshttps://doi.org/10.1093/ietisy/e91-d.5.1466openalex-snapshot
A Strongly Unforgeable Signature under the CDH Assumption without Collision Resistant Hash Functions
inferred← citeshttps://doi.org/10.1109/ccc.2009.11openalex-snapshot
On Basing ZK ≠ BPP on the Hardness of PAC Learning
inferred← citeshttps://doi.org/10.1109/ccc.2010.17openalex-snapshot
A New Sampling Protocol and Applications to Basing Cryptographic Primitives on the Hardness of NP
inferred← citeshttps://doi.org/10.1109/focs.2006.54openalex-snapshot
On the Compressibility of NP Instances and Cryptographic Applications
inferred← citeshttps://doi.org/10.1109/focs.2006.71openalex-snapshot
Statistical Zero-Knowledge Arguments for NP from Any One-Way Function
inferred← citeshttps://doi.org/10.1109/focs.2007.4389535openalex-snapshot
Finding Collisions in Interactive Protocols - A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments
inferred← citeshttps://doi.org/10.1109/focs.2007.7openalex-snapshot
Finding Collisions in Interactive Protocols - A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments
inferred← citeshttps://doi.org/10.1109/focs.2008.67openalex-snapshot
On the Impossibility of Basing Identity Based Encryption on Trapdoor Permutations
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.21openalex-snapshot
Limits on the Power of Indistinguishability Obfuscation and Functional Encryption
inferred← citeshttps://doi.org/10.1109/focs.2017.63openalex-snapshot
White-Box vs. Black-Box Complexity of Search Problems: Ramsey and Graph Property Testing
inferred← citeshttps://doi.org/10.1109/focs.2018.00085openalex-snapshot
Cryptographic Hashing from Strong One-Way Functions (Or: One-Way Product Functions and Their Applications)
inferred← citeshttps://doi.org/10.1109/sfcs.2000.892119openalex-snapshot
Lower bounds on the efficiency of generic cryptographic constructions
inferred← citeshttps://doi.org/10.1109/sfcs.2000.892121openalex-snapshot
The relationship between public key encryption and oblivious transfer
inferred← citeshttps://doi.org/10.1109/sfcs.2001.959887openalex-snapshot
On the impossibility of basing trapdoor functions on trapdoor predicates
inferred← citeshttps://doi.org/10.1109/sffcs.1999.814627openalex-snapshot
Limits on the efficiency of one-way permutation-based hash functions
inferred← citeshttps://doi.org/10.1109/tit.2002.801402openalex-snapshot
Construction of secure and fast hash functions using nonbinary error-correcting codes
inferred← citeshttps://doi.org/10.1109/tit.2005.859244openalex-snapshot
Masking-Based Domain Extenders for UOWHFs: Bounds and Constructions
inferred← citeshttps://doi.org/10.1137/060668092openalex-snapshot
On the Compressibility of $\mathcal{NP}$ Instances and Cryptographic Applications
inferred← citeshttps://doi.org/10.1137/080725404openalex-snapshot
Statistically Hiding Commitments and Statistical Zero-Knowledge Arguments from Any One-Way Function
inferred← citeshttps://doi.org/10.1137/130938438openalex-snapshot
Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments
inferred← citeshttps://doi.org/10.1137/s0097539702403773openalex-snapshot
Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
inferred← citeshttps://doi.org/10.1137/s0097539704443276openalex-snapshot
Bounds on the Efficiency of Generic Cryptographic Constructions
showing the first 200 of 223 · page through all 223
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.