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)

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
Universal reductions: reductions relative to stateful oracles
On constructing one-way permutations from indistinguishability obfuscation
Merkle's key agreement protocol is optimal: an \(O(n^2)\) attack on any key agreement from random oracles
The relationship between idealized models under computationally bounded adversaries
On the round complexity of black-box secure MPC
A new spin on quantum cryptography: avoiding trapdoors and embracing public keys
Pseudoentropy: lower-bounds for chain rules and transformations
OT-Combiners via Secure Computation
Cryptography from pseudorandom quantum states
Can PPAD hardness be based on standard cryptographic assumptions?
On the complexity of compressing obfuscation
On the Security of Padding-Based Encryption Schemes – or – Why We Cannot Prove OAEP Secure in the Standard Model
The journey from NP to TFNP hardness
Revisiting the indifferentiability of the sum of permutations
Composition Implies Adaptive Security in Minicrypt
scientific article; zbMATH DE number 7758312 (Why is no real title available?)
Key-dependent message security: generic amplification and completeness
Secure multiparty RAM computation in constant rounds
Bounds on the efficiency of black-box commitment schemes
Cloning games: a general framework for unclonable primitives
On the impossibility of algebraic NIZK in pairing-free groups
Secure computation with shared EPR pairs (or: how to teleport in zero-knowledge)
Reducing complexity assumptions for statistically-hiding commitment
Pseudorandom functions: three decades later
On the Impossibility of Virtual Black-Box Obfuscation in Idealized Models
Unprovable security of perfect NIZK and non-interactive non-malleable commitments
Fine-Grained Cryptography
Certifying trapdoor permutations, revisited
Actively secure 1-out-of-\(N\) OT extension with application to private set intersection
KHAPE: Asymmetric PAKE from key-hiding key exchange
On statistically secure obfuscation with approximate correctness
A lower bound on the length of signatures based on group actions and generic isogenies
On the black-box impossibility of multi-designated verifiers signature schemes from ring signature schemes
Incompressible cryptography
On building fine-grained one-way functions from strong average-case hardness
Cryptographic functions from worst-case complexity assumptions
Batching base oblivious transfers
Blazing fast OT for three-round UC OT extension
Which languages have 4-round fully black-box zero-knowledge arguments from one-way functions?
Oblivious transfer is in MiniQCrypt
Proofs of Work from worst-case assumptions
Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?
Obfustopia built on secret-key functional encryption
Finding collisions in interactive protocols -- tight lower bounds on the round and communication complexities of statistically hiding commitments
Functional inversion and communication complexity
Magic adversaries versus individual reduction: science wins either way

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)