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)

Reducing complexity assumptions for statistically-hiding commitment
Functional inversion and communication complexity
Characterizing the existence of one-way permutations
Two-round MPC: information-theoretic and black-box
Enhancements are blackbox non-trivial: impossibility of enhanced trapdoor permutations from standard trapdoor permutations
Certifying trapdoor permutations, revisited
On the security loss of unique signatures
Impossibility of simulation secure functional encryption even with random oracles
Proofs of Work from worst-case assumptions
A black-box construction of non-malleable encryption from semantically secure encryption
Deterministic encryption with the Thorp shuffle
One-way permutations and self-witnessing languages
Complexity limitations on quantum computation
Which languages have 4-round fully black-box zero-knowledge arguments from one-way functions?
Blazing fast OT for three-round UC OT extension
Oblivious transfer is in MiniQCrypt
Indifferentiability for public key cryptosystems
The summation-truncation hybrid: reusing discarded bits for free
Black-box use of one-way functions is useless for optimal fair coin-tossing
Efficient oblivious evaluation protocol and conditional disclosure of secrets for DFA
New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust
On subset-resilient hash function families
On the streaming indistinguishability of a random permutation and a random function
One-way functions imply secure computation in a quantum world
Computational hardness of optimal fair computation: beyond Minicrypt
On the round complexity of black-box secure MPC
Towards a unified approach to black-box constructions of zero-knowledge proofs
KHAPE: Asymmetric PAKE from key-hiding key exchange
Incompressible cryptography
On building fine-grained one-way functions from strong average-case hardness
Feasibility and infeasibility of secure computation with malicious PUFs
A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement
On the complexity of collision resistant hash functions: new and old black-box separations
Being a permutation is also orthogonal to one-wayness in quantum world: impossibilities of quantum one-way permutations from one-wayness primitives
Secure two-party computation in a quantum world
Efficient, actively secure MPC with a dishonest majority: a survey
Bounds on the efficiency of black-box commitment schemes
On black-box complexity of universally composable security in the CRS model
Cryptography and algorithmic randomness
Derandomized constructions of \(k\)-wise (almost) independent permutations
Merkle's key agreement protocol is optimal: an \(O(n^2)\) attack on any key agreement from random oracles
More efficient oblivious transfer extensions
Completeness for symmetric two-party functionalities: revisited
On constructing one-way permutations from indistinguishability obfuscation
The impossibility of basing one-way permutations on central cryptographic primitives
On actively-secure elementary MPC reductions
On derandomizing Yao's weak-to-strong OWF construction
On the impossibility of purely algebraic signatures
How to build an ideal cipher: the indifferentiability of the Feistel construction
Efficient set intersection with simulation-based security
On the XOR of multiple random permutations
On the Impossibility of Virtual Black-Box Obfuscation in Idealized Models
Lower bounds on assumptions behind indistinguishability obfuscation
Homomorphic evaluation requires depth
On constructing one-way permutations from indistinguishability obfuscation
Network oblivious transfer
On statistically secure obfuscation with approximate correctness
Linicrypt: a model for practical cryptography
Fine-Grained Cryptography
Limits on the usefulness of random oracles
The simplest protocol for oblivious transfer
Actively secure 1-out-of-N OT extension with application to private set intersection
Impossibility of blind signatures from one-way permutations
Secret-Sharing Schemes: A Survey
Weak oblivious transfer from strong one-way functions
A new spin on quantum cryptography: avoiding trapdoors and embracing public keys
Limits on the power of indistinguishability obfuscation and functional encryption
Pseudoentropy: lower-bounds for chain rules and transformations
Secure multiparty RAM computation in constant rounds
Towards non-black-box separations of public key encryption and one way function
Unprovable security of perfect NIZK and non-interactive non-malleable commitments
On the necessary and sufficient assumptions for UC computation
Two is a crowd? A black-box separation of one-wayness and security under correlated inputs
Equivalence of uniform key agreement and composition insecurity
Composition Implies Adaptive Security in Minicrypt
Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
On the Security Loss in Cryptographic Reductions
On the Security of Padding-Based Encryption Schemes – or – Why We Cannot Prove OAEP Secure in the Standard Model
Efficiency Bounds for Adversary Constructions in Black-Box Reductions
On the Theoretical Gap between Group Signatures with and without Unlinkability
Simultaneous strong separations of probabilistic and unambiguous complexity classes
On the Impossibilities of Basing One-Way Permutations on Central Cryptographic Primitives
scientific article; zbMATH DE number 2079922 (Why is no real title available?)
On characterizations of escrow encryption schemes
The journey from NP to TFNP hardness
Pseudorandom functions: three decades later
On black-box extensions of non-interactive zero-knowledge arguments, and signatures directly from simulation soundness
On the Communication Complexity of Key-Agreement Protocols.
Secure commitment against a powerful adversary
Computational two-party correlation: a dichotomy for key-agreement protocols
Structure versus hardness through the obfuscation lens
Cryptographic functions from worst-case complexity assumptions
Finding collisions in interactive protocols -- tight lower bounds on the round and communication complexities of statistically hiding commitments
Toward fine-grained blackbox separations between semantic and circular-security notions
Basing Weak Public-Key Cryptography on Strong One-Way Functions
OT-Combiners via Secure Computation
A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval
Black-Box Constructions for Fully-Simulatable Oblivious Transfer Protocols
Can We Construct Unbounded Time-Stamping Schemes from Collision-Free Hash Functions?
Robust transforming combiners from indistinguishability obfuscation to functional encryption

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)