scientific article; zbMATH DE number 4185033
From MaRDI portal
zbMATH Open0718.68042MaRDI QIDQ5750403FDOQ5750403
Authors: Russell Impagliazzo, Steven Rudich 
Publication date: 1990
Title of this publication is not available (Why is that?)
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
Data encryption (aspects in computer science) (68P25) Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60)
Cited In (only showing first 100 items - show all)
- Efficient, actively secure MPC with a dishonest majority: a survey
- On subset-resilient hash function families
- On the Impossibilities of Basing One-Way Permutations on Central Cryptographic Primitives
- A random oracle for all of us
- Computational hardness of optimal fair computation: beyond Minicrypt
- Round-optimal black-box secure computation from two-round malicious OT
- Efficient set intersection with simulation-based security
- How to build an ideal cipher: the indifferentiability of the Feistel construction
- Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
- On actively-secure elementary MPC reductions
- One-way permutations and self-witnessing languages
- 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
- Linicrypt: a model for practical cryptography
- Deterministic encryption with the Thorp shuffle
- Limits on the usefulness of random oracles
- Complexity limitations on quantum computation
- Two is a crowd? A black-box separation of one-wayness and security under correlated inputs
- Lower bounds on assumptions behind indistinguishability obfuscation
- Network oblivious transfer
- Limits on the power of indistinguishability obfuscation and functional encryption
- Efficient oblivious evaluation protocol and conditional disclosure of secrets for DFA
- Merkle's key agreement protocol is optimal: an \(O(n^2)\) attack on any key agreement from random oracles
- On the round complexity of black-box secure MPC
- A new spin on quantum cryptography: avoiding trapdoors and embracing public keys
- OT-Combiners via Secure Computation
- Cryptography from pseudorandom quantum states
- 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
- Secure multiparty RAM computation in constant rounds
- Key-dependent message security: generic amplification and completeness
- Pseudorandom functions: three decades later
- On the Impossibility of Virtual Black-Box Obfuscation in Idealized Models
- Reducing complexity assumptions for statistically-hiding commitment
- Fine-Grained Cryptography
- Unprovable security of perfect NIZK and non-interactive non-malleable commitments
- Actively secure 1-out-of-\(N\) OT extension with application to private set intersection
- Certifying trapdoor permutations, revisited
- KHAPE: Asymmetric PAKE from key-hiding key exchange
- 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
- 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
- Functional inversion and communication complexity
- Completeness for symmetric two-party functionalities: revisited
- On the necessary and sufficient assumptions for UC computation
- On the XOR of multiple random permutations
- Structure versus hardness through the obfuscation lens
- Derandomized constructions of \(k\)-wise (almost) independent permutations
- Title not available (Why is that?)
- More efficient oblivious transfer extensions
- Secure two-party computation in a quantum world
- Secure commitment against a powerful adversary
- Adaptive zero-knowledge proofs and adaptively secure oblivious transfer
- Impossibility of blind signatures from one-way permutations
- Secret-Sharing Schemes: A Survey
- Computational two-party correlation: a dichotomy for key-agreement protocols
- On black-box extensions of non-interactive zero-knowledge arguments, and signatures directly from simulation soundness
- Feasibility and infeasibility of secure computation with malicious PUFs
- Simultaneous strong separations of probabilistic and unambiguous complexity classes
- Robust transforming combiners from indistinguishability obfuscation to functional encryption
- 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
- The simplest protocol for oblivious transfer
- On the streaming indistinguishability of a random permutation and a random function
- Characterizing the existence of one-way permutations
- To label, or not to label (in generic groups)
- A black-box construction of non-malleable encryption from semantically secure encryption
- On black-box complexity of universally composable security in the CRS model
- On building fine-grained one-way functions from strong average-case hardness
- Cryptographic primitives with hinting property
- Black-box separations for non-interactive classical commitments in a quantum world
- New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust
- On the Security Loss in Cryptographic Reductions
- One-way functions imply secure computation 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
- Improved multi-user security using the squared-ratio method
- Being a permutation is also orthogonal to one-wayness in quantum world: impossibilities of quantum one-way permutations from one-wayness primitives
- Homomorphic evaluation requires depth
- On constructing one-way permutations from indistinguishability obfuscation
- Towards a unified approach to black-box constructions of zero-knowledge proofs
- The impossibility of basing one-way permutations on central cryptographic primitives
- Communication lower bounds of key-agreement protocols via density increment arguments
- Searching for ELFs in the cryptographic forest
- On the Communication Complexity of Key-Agreement Protocols.
- 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
- Public-key encryption with quantum keys
- Low communication complexity protocols, collision resistant hash functions and secret key-agreement protocols
- A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement
- Cryptography and algorithmic randomness
- Lifting standard model reductions to common setup assumptions
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)
