Proceedings Article10.1145/2591796.2591825
How to use indistinguishability obfuscation: deniable encryption, and more
Amit Sahai,Brent Waters +1 more
- 31 May 2014
- pp 475-484
TL;DR: Punctured programs as discussed by the authors is a new technique to apply indistinguishability obfuscation to cryptographic problems, and it has been used to construct a variety of core cryptographic objects from obfuscation and one-way functions (or close variants).
read more
Abstract: We introduce a new technique, that we call punctured programs, to apply indistinguishability obfuscation towards cryptographic problems. We use this technique to carry out a systematic study of the applicability of indistinguishability obfuscation to a variety of cryptographic goals. Along the way, we resolve the 16-year-old open question of Deniable Encryption, posed by Canetti, Dwork, Naor, and Ostrovsky in 1997: In deniable encryption, a sender who is forced to reveal to an adversary both her message and the randomness she used for encrypting it should be able to convincingly provide "fake" randomness that can explain any alternative message that she would like to pretend that she sent. We resolve this question by giving the first construction of deniable encryption that does not require any pre-planning by the party that must later issue a denial. In addition, we show the generality of our punctured programs technique by also constructing a variety of core cryptographic objects from indistinguishability obfuscation and one-way functions (or close variants). In particular we obtain: public key encryption, short "hash-and-sign" selectively secure signatures, chosen-ciphertext secure public key encryption, non-interactive zero knowledge proofs (NIZKs), injective trapdoor functions, and oblivious transfer. These results suggest the possibility of indistinguishability obfuscation becoming a "central hub" for cryptography.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Posted Content
Indistinguishability Obfuscation from Semantically-Secure Multilinear Encodings
Rafael Pass,Karn Seth,Sidharth Telang +2 more
- 01 Jan 2014
TL;DR: In this paper, the authors define a notion of semantically secure encoding schemes, which stipulates security of class of algebraic "decisional" assumptions: roughly speaking, we require that for every nuPPT distribution D over two constant-length sequences ~ m0, ~ m1 and auxiliary elements ~z such that all arithmetic circuits (respecting the multilinear restrictions and ending with a zerotest) are constant with overwhelming probability over b ∈ {0, 1), we have that encodings of ~ m 0, ~z are computationally indistinguishable
Constrained (Verifiable) Pseudorandom Function from Functional Encryption
Pratish Datta
- 25 Sep 2018
TL;DR: This paper presents a constrained pseudorandom function (CPRF) supporting constraints realizable by polynomial-size circuits, assuming the existence of (public key) functional encryption (FE) with standardPolynomial security against arbitrary collusions, and augments the CPRF construction with the verifiability feature under the same assumption.
2
Simpler Constructions of Asymmetric Primitives from Obfuscation
Pooya Farshim,Georg Fuchsbauer,Alain Passelègue +2 more
- 13 Dec 2020
TL;DR: An unbounded HIBE, which uses (public-coin) differing-inputs obfuscation for circuits and whose proof relies on a recent pebbling-based hybrid argument by Fuchsbauer et al. (ASIACRYPT’14).
2
•Posted Content
Verifiable and Delegatable Constrained Pseudorandom Functions for Unconstrained Inputs.
TL;DR: A flaw in their security argument is identified and resolved by carefully modifying their construction and suitably redesigning the security proof, and the first ever CVPRF and DCPRF constructions that can handle inputs of unbounded polynomial length are presented.
2
•Posted Content
Indistinguishability obfuscation for quantum circuits of low T-count
Anne Broadbent,Raza Ali Kazmi +1 more
TL;DR: In this paper, the authors studied schemes for indistinguishability obfuscation for quantum circuits, where the size of the output of the obfuscator is exponential in the number of non-Clifford (T) gates.
2
References
New Directions in Cryptography
TL;DR: This paper suggests ways to solve currently open problems in cryptography, and discusses how the theories of communication and computation are beginning to provide the tools to solve cryptographic problems of long standing.
Fully homomorphic encryption using ideal lattices
Craig Gentry
- 31 May 2009
TL;DR: This work proposes a fully homomorphic encryption scheme that allows one to evaluate circuits over encrypted data without being able to decrypt, and describes a public key encryption scheme using ideal lattices that is almost bootstrappable.
A digital signature scheme secure against adaptive chosen-message attacks
TL;DR: A digital signature scheme based on the computational difficulty of integer factorization possesses the novel property of being robust against an adaptive chosen-message attack: an adversary who receives signatures for messages of his choice cannot later forge the signature of even a single additional message.
Leveled) fully homomorphic encryption without bootstrapping
Zvika Brakerski,Craig Gentry,Vinod Vaikuntanathan +2 more
- 08 Jan 2012
TL;DR: A novel approach to fully homomorphic encryption (FHE) that dramatically improves performance and bases security on weaker assumptions, using some new techniques recently introduced by Brakerski and Vaikuntanathan (FOCS 2011).
Foundations of Cryptography
Oded Goldreich
- 06 Aug 2001
TL;DR: In this paper, the authors present a list of figures in the context of digital signatures and message authentication for general cryptographic protocols, including encryption, digital signatures, message authentication, and digital signatures.
2.2K
Related Papers (5)
Dan Boneh,Brent Waters +1 more
- 01 Dec 2013
Elette Boyle,Shafi Goldwasser,Ioana Ivan +2 more
- 26 Mar 2014