scientific article; zbMATH DE number 4185033

Recommendations

On the Impossibilities of Basing One-Way Permutations on Central Cryptographic Primitives
The impossibility of basing one-way permutations on central cryptographic primitives
On the Impossibility of Basing Public-Coin One-Way Permutations on Trapdoor Permutations
Perfect zero-knowledge arguments for NP using any one-way permutation
Theory of Cryptography

Cited in

(only showing first 100 items - show all)

Impossibility of indifferentiable iterated blockciphers from 3 or less primitive calls
On the complexity of collision resistant hash functions: new and old black-box separations
Completeness for symmetric two-party functionalities: revisited
On the XOR of multiple random permutations
On the necessary and sufficient assumptions for UC computation
Computational Irrelevancy: Bridging the Gap Between Pseudo- and Real Randomness in MPC Protocols
Structure versus hardness through the obfuscation lens
Derandomized constructions of \(k\)-wise (almost) independent permutations
scientific article; zbMATH DE number 2079922 (Why is no real title available?)
Information-theoretic security with asymmetries
Quantum public-key encryption with tamper-resilient public keys from one-way functions
Non-Observable Quantum Random Oracle Model
Hard languages in NP \(\cap\) coNP and NIZK proofs from unstructured hardness
Quantum cryptography in Algorithmica
More efficient oblivious transfer extensions
Efficiency Bounds for Adversary Constructions in Black-Box Reductions
Black-Box Constructions for Fully-Simulatable Oblivious Transfer Protocols
Secure two-party computation in a quantum world
On characterizations of escrow encryption schemes
Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?
On the Theoretical Gap between Group Signatures with and without Unlinkability
Quantum commitments and signatures without one-way functions
\textsf{LR-OT}: leakage-resilient oblivious transfer
Can We Construct Unbounded Time-Stamping Schemes from Collision-Free Hash Functions?
Adaptive zero-knowledge proofs and adaptively secure oblivious transfer
On the impossibility of key agreements from quantum random oracles
Secure commitment against a powerful adversary
Impossibility of blind signatures from one-way permutations
On derandomizing Yao's weak-to-strong OWF construction
On the impossibility of purely algebraic signatures
Is it possible to improve Yao's XOR lemma using reductions that exploit the efficiency of their oracle?
On the impossibility of algebraic vector commitments in pairing-free groups
Secret-Sharing Schemes: A Survey
Weak oblivious transfer from strong one-way functions
Feasibility and infeasibility of secure computation with malicious PUFs
Simultaneous strong separations of probabilistic and unambiguous complexity classes
Computational two-party correlation: a dichotomy for key-agreement protocols
Lower bound on SNARGs in the random oracle model
On black-box extensions of non-interactive zero-knowledge arguments, and signatures directly from simulation soundness
Black-box use of one-way functions is useless for optimal fair coin-tossing
Indifferentiability for public key cryptosystems
The summation-truncation hybrid: reusing discarded bits for free
On the streaming indistinguishability of a random permutation and a random function
The simplest protocol for oblivious transfer
Characterizing the existence of one-way permutations
Robust transforming combiners from indistinguishability obfuscation to functional encryption
A black-box construction of non-malleable encryption from semantically secure encryption
Efficient, actively secure MPC with a dishonest majority: a survey
On black-box complexity of universally composable security in the CRS model
To label, or not to label (in generic groups)
On subset-resilient hash function families
On building fine-grained one-way functions from strong average-case hardness
New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust
One-way functions imply secure computation in a quantum world
On the Security Loss in Cryptographic Reductions
Cryptographic primitives with hinting property
Black-box separations for non-interactive classical commitments in a quantum world
On the (im)plausibility of public-key quantum money from collision-resistant hash functions
Equivalence of uniform key agreement and composition insecurity
Being a permutation is also orthogonal to one-wayness in quantum world: impossibilities of quantum one-way permutations from one-wayness primitives
Efficient set intersection with simulation-based security
How to build an ideal cipher: the indifferentiability of the Feistel construction
Computational hardness of optimal fair computation: beyond Minicrypt
Improved multi-user security using the squared-ratio method
On the Impossibilities of Basing One-Way Permutations on Central Cryptographic Primitives
A random oracle for all of us
Round-optimal black-box secure computation from two-round malicious OT
Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
Homomorphic evaluation requires depth
On constructing one-way permutations from indistinguishability obfuscation
One-way permutations and self-witnessing languages
Towards a unified approach to black-box constructions of zero-knowledge proofs
On actively-secure elementary MPC reductions
The impossibility of basing one-way permutations on central cryptographic primitives
On the Communication Complexity of Key-Agreement Protocols.
Communication lower bounds of key-agreement protocols via density increment arguments
Searching for ELFs in the cryptographic forest
Toward fine-grained blackbox separations between semantic and circular-security notions
A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval
Basing Weak Public-Key Cryptography on Strong One-Way Functions
Towards non-black-box separations of public key encryption and one way function
Enhancements are blackbox non-trivial: impossibility of enhanced trapdoor permutations from standard trapdoor permutations
Impossibility of simulation secure functional encryption even with random oracles
On the security loss of unique signatures
Two-round MPC: information-theoretic and black-box
Limits on the usefulness of random oracles
Public-key encryption with quantum keys
Deterministic encryption with the Thorp shuffle
Complexity limitations on quantum computation
Linicrypt: a model for practical cryptography
A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement
Two is a crowd? A black-box separation of one-wayness and security under correlated inputs
Low communication complexity protocols, collision resistant hash functions and secret key-agreement protocols
Lower bounds on assumptions behind indistinguishability obfuscation
Cryptography and algorithmic randomness
Network oblivious transfer
Limits on the power of indistinguishability obfuscation and functional encryption
Efficient oblivious evaluation protocol and conditional disclosure of secrets for DFA
Lifting standard model reductions to common setup assumptions
Quantum attacks on PRFs based on public random permutations

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5750403)