On Constructing One-Way Permutations from Indistinguishability Obfuscation (Q2799107): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-662-49099-0_19 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2295084910 / rank
 
Normal rank
Property / cites work
 
Property / cites work: From Selective to Adaptive Security in Functional Encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Indistinguishability Obfuscation from Compact Functional Encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limits on the Power of Indistinguishability Obfuscation and Functional Encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Constructing One-Way Permutations from Indistinguishability Obfuscation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Notions of Black-Box Reductions, Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the (im)possibility of obfuscating programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Merkle Puzzles Are Optimal — An O(n2)-Query Attack on Any Key Exchange from a Random Oracle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Poly-Many Hardcore Bits for Any One-Way Function and a Framework for Differing-Inputs Obfuscation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Impossibility of Obfuscation with Auxiliary Input or a Universal Simulator / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Virtual Grey Box Obfuscation for General Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: ZAPs and Non-Interactive Witness Indistinguishability from Indistinguishability Obfuscation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect Structure on the Edge of Chaos / rank
 
Normal rank
Property / cites work
 
Property / cites work: Indistinguishability Obfuscation: From Approximate to Exact / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Generate Cryptographically Strong Sequences of Pseudorandom Bits / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Basing Size-Verifiable One-Way Functions on NP-Hardness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiparty Key Exchange, Efficient Traitor Tracing, and More from Indistinguishability Obfuscation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limits on the Power of Zero-Knowledge Proofs in Cryptographic Constructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random-Oracle Uninstantiability from Indistinguishability Obfuscation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptively Secure Two-Party Computation from Indistinguishability Obfuscation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Obfuscation of Probabilistic Circuits and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Obfuscation with Random Oracles / rank
 
Normal rank
Property / cites work
 
Property / cites work: The impossibility of basing one-way permutations on central cryptographic primitives / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of nonuniformity in proofs of security / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant-Round Concurrent Zero-Knowledge from Indistinguishability Obfuscation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptively Secure, Universally Composable, Multiparty Computation in Constant Rounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Black-Box Complexity of Optimally-Fair Coin Tossing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Can Optimally-Fair Coin Tossing Be Based on One-Way Functions? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Round Secure MPC from Indistinguishability Obfuscation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Round Adaptively Secure MPC from Indistinguishability Obfuscation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the Efficiency of Generic Cryptographic Constructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a Separation of Semantic and CCA Security for Public Key Encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-input Functional Encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Pseudorandom Generator from any One-way Function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Replacing a Random Oracle: Full Domain Hash from Indistinguishability Obfuscation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology – CRYPTO 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5750403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Dual BKR Inequality and Rudich's Conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871218 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Power of Public-Key Encryption in Secure Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Curious Case of Non-Interactive Commitments – On the Power of Black-Box vs. Non-Black-Box Use of Primitives / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Impossibility of Basing Public-Coin One-Way Permutations on Trapdoor Permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Black-Box Separations among Injective One-Way Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards Non-Black-Box Lower Bounds in Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: A method for obtaining digital signatures and public-key cryptosystems / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to use indistinguishability obfuscation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4249649 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Punctured Programming Approach to Adaptively Secure Functional Encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-Way Permutations, Interactive Hashing and Statistically Hiding Commitments / rank
 
Normal rank

Latest revision as of 19:02, 11 July 2024

scientific article
Language Label Description Also known as
English
On Constructing One-Way Permutations from Indistinguishability Obfuscation
scientific article

    Statements

    On Constructing One-Way Permutations from Indistinguishability Obfuscation (English)
    0 references
    0 references
    0 references
    8 April 2016
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers