scientific article; zbMATH DE number 4185033

Publication date: 1990

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

one-way permutations secure secret key agreement

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (only showing first 100 items - show all)

One-way functions imply secure computation in a quantum world ⋮ How to build an ideal cipher: the indifferentiability of the Feistel construction ⋮ Efficient set intersection with simulation-based security ⋮ One-way permutations and self-witnessing languages ⋮ On Black-Box Extensions of Non-interactive Zero-Knowledge Arguments, and Signatures Directly from Simulation Soundness ⋮ Computational hardness of optimal fair computation: beyond Minicrypt ⋮ On the round complexity of black-box secure MPC ⋮ Functional inversion and communication complexity ⋮ Limits on the usefulness of random oracles ⋮ 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 ⋮ Towards a unified approach to black-box constructions of zero-knowledge proofs ⋮ KHAPE: Asymmetric PAKE from key-hiding key exchange ⋮ The Journey from NP to TFNP Hardness ⋮ 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 ⋮ Simultaneous strong separations of probabilistic and unambiguous complexity classes ⋮ Unprovable security of perfect NIZK and non-interactive non-malleable commitments ⋮ Derandomized constructions of \(k\)-wise (almost) independent permutations ⋮ Incompressible cryptography ⋮ On building fine-grained one-way functions from strong average-case hardness ⋮ On characterizations of escrow encryption schemes ⋮ Feasibility and infeasibility of secure computation with malicious PUFs ⋮ Proofs of Work from worst-case assumptions ⋮ 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 ⋮ 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 Simplest Protocol for Oblivious Transfer ⋮ Secure commitment against a powerful adversary ⋮ On actively-secure elementary MPC reductions ⋮ On derandomizing Yao's weak-to-strong OWF construction ⋮ On the impossibility of purely algebraic signatures ⋮ Actively Secure 1-out-of-N OT Extension with Application to Private Set Intersection ⋮ Complexity limitations on quantum computation ⋮ Being a permutation is also orthogonal to one-wayness in quantum world: impossibilities of quantum one-way permutations from one-wayness primitives ⋮ Adaptive zero-knowledge proofs and adaptively secure oblivious transfer ⋮ Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols ⋮ Secure two-party computation in a quantum world ⋮ Efficient, actively secure MPC with a dishonest majority: a survey ⋮ Structure Versus Hardness Through the Obfuscation Lens ⋮ Secret-Sharing Schemes: A Survey ⋮ A black-box construction of non-malleable encryption from semantically secure encryption ⋮ Deterministic encryption with the Thorp shuffle ⋮ Robust Transforming Combiners from Indistinguishability Obfuscation to Functional Encryption ⋮ Magic Adversaries Versus Individual Reduction: Science Wins Either Way ⋮ Bounds on the efficiency of black-box commitment schemes ⋮ Composition Implies Adaptive Security in Minicrypt ⋮ Cryptographic Functions from Worst-Case Complexity Assumptions ⋮ Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier? ⋮ Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier? ⋮ 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 ⋮ 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 ⋮ Key-dependent message security: generic amplification and completeness ⋮ 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 ⋮ Which languages have 4-round fully black-box zero-knowledge arguments from one-way functions? ⋮ Blazing fast OT for three-round UC OT extension ⋮ Efficiency Bounds for Adversary Constructions in Black-Box Reductions ⋮ Oblivious transfer is in MiniQCrypt ⋮ On the Theoretical Gap between Group Signatures with and without Unlinkability ⋮ Weak Oblivious Transfer from Strong One-Way Functions ⋮ On the Communication Complexity of Key-Agreement Protocols. ⋮ Reducing complexity assumptions for statistically-hiding commitment ⋮ Network Oblivious Transfer ⋮ On Statistically Secure Obfuscation with Approximate Correctness ⋮ Linicrypt: A Model for Practical Cryptography ⋮ Fine-Grained Cryptography ⋮ A New Spin on Quantum Cryptography: Avoiding Trapdoors and Embracing Public Keys ⋮ On black-box complexity of universally composable security in the CRS model ⋮ 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 ⋮ Characterizing the existence of one-way permutations ⋮ Black-Box Constructions for Fully-Simulatable Oblivious Transfer Protocols ⋮ Can We Construct Unbounded Time-Stamping Schemes from Collision-Free Hash Functions? ⋮ Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments ⋮ 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 ⋮ Pseudorandom Functions: Three Decades Later ⋮ Toward Fine-Grained Blackbox Separations Between Semantic and Circular-Security Notions ⋮ Cryptography and algorithmic randomness ⋮ On subset-resilient hash function families ⋮ On the streaming indistinguishability of a random permutation and a random function

This page was built for publication: