On Constructing One-Way Permutations from Indistinguishability Obfuscation (Q2799107)

From MaRDI portal

Jump to:navigation, search

scientific article

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

Statements

scholarly article

0 references

On Constructing One-Way Permutations from Indistinguishability Obfuscation (English)

0 references

0 references

0 references

Theory of Cryptography

0 references

publication date

8 April 2016

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-662-49099-0_19

0 references

From Selective to Adaptive Security in Functional Encryption

0 references

Indistinguishability Obfuscation from Compact Functional Encryption

0 references

Limits on the Power of Indistinguishability Obfuscation and Functional Encryption

0 references

On Constructing One-Way Permutations from Indistinguishability Obfuscation

0 references

Notions of Black-Box Reductions, Revisited

0 references

On the (im)possibility of obfuscating programs

0 references

Merkle Puzzles Are Optimal — An O(n2)-Query Attack on Any Key Exchange from a Random Oracle

0 references

Poly-Many Hardcore Bits for Any One-Way Function and a Framework for Differing-Inputs Obfuscation

0 references

The Impossibility of Obfuscation with Auxiliary Input or a Universal Simulator

0 references

On Virtual Grey Box Obfuscation for General Circuits

0 references

ZAPs and Non-Interactive Witness Indistinguishability from Indistinguishability Obfuscation

0 references

Perfect Structure on the Edge of Chaos

0 references

Indistinguishability Obfuscation: From Approximate to Exact

0 references

How to Generate Cryptographically Strong Sequences of Pseudorandom Bits

0 references

On Basing Size-Verifiable One-Way Functions on NP-Hardness

0 references

Multiparty Key Exchange, Efficient Traitor Tracing, and More from Indistinguishability Obfuscation

0 references

Limits on the Power of Zero-Knowledge Proofs in Cryptographic Constructions

0 references

Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding

0 references

Random-Oracle Uninstantiability from Indistinguishability Obfuscation

0 references

Adaptively Secure Two-Party Computation from Indistinguishability Obfuscation

0 references

Obfuscation of Probabilistic Circuits and Applications

0 references

On Obfuscation with Random Oracles

0 references

The impossibility of basing one-way permutations on central cryptographic primitives

0 references

On the power of nonuniformity in proofs of security

0 references

Constant-Round Concurrent Zero-Knowledge from Indistinguishability Obfuscation

0 references

Adaptively Secure, Universally Composable, Multiparty Computation in Constant Rounds

0 references

On the Black-Box Complexity of Optimally-Fair Coin Tossing

0 references

Can Optimally-Fair Coin Tossing Be Based on One-Way Functions?

0 references

Two-Round Secure MPC from Indistinguishability Obfuscation

0 references

Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits

0 references

Two-Round Adaptively Secure MPC from Indistinguishability Obfuscation

0 references

Bounds on the Efficiency of Generic Cryptographic Constructions

0 references

Towards a Separation of Semantic and CCA Security for Public Key Encryption

0 references

Foundations of Cryptography

0 references

Multi-input Functional Encryption

0 references

Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments

0 references

A Pseudorandom Generator from any One-way Function

0 references

Replacing a Random Oracle: Full Domain Hash from Indistinguishability Obfuscation

0 references

Advances in Cryptology – CRYPTO 2004

0 references

0 references

The Dual BKR Inequality and Rudich's Conjecture

0 references

0 references

On the Power of Public-Key Encryption in Secure Computation

0 references

The Curious Case of Non-Interactive Commitments – On the Power of Black-Box vs. Non-Black-Box Use of Primitives

0 references

On the Impossibility of Basing Public-Coin One-Way Permutations on Trapdoor Permutations

0 references

On Black-Box Separations among Injective One-Way Functions

0 references

Towards Non-Black-Box Lower Bounds in Cryptography

0 references

Theory of Cryptography

0 references

A method for obtaining digital signatures and public-key cryptosystems

0 references

How to use indistinguishability obfuscation

0 references

0 references

A Punctured Programming Approach to Adaptively Secure Functional Encryption

0 references

One-Way Permutations, Interactive Hashing and Statistically Hiding Commitments

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-662-49099-0_19

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2799107

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2799107&oldid=36240785"