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
•Dissertation
Succinct representations of Boolean functions and the Circuit-SAT problem
Shadab Romani
- 01 Apr 2016
TL;DR: It is argued that a significant computational advantage for a large class of properties implies a non-trivial algorithm for the Circuit Satisfiability (Circuit-SAT) problem, and it is shown that if there is a property with strong black-box lower bounds yet decidable in BPP, which also has a highly sensitive instance of the function computable by a small circuit, then there is an non-uniform sub-exponential algorithm for this problem.
Deniable Cryptosystems: Simpler Constructions and Achieving Leakage Resilience
Zhiyuan An,Haibo Tian,Chao Chen,Fangguo Zhang +3 more
TL;DR: Deniable cryptosystems achieve leakage resilience and simpler constructions by leveraging the power of side-channel attacks and designing a new framework for flipping a bit-string.
Private Functional Encryption – Hiding What Cannot Be Learned Through Function Evaluation
Afonso Arriaga
- 17 Jan 2017
TL;DR: Five constructions of private functional encryption supporting different classes of functions and meeting varying degrees of security are presented, including a white-box construction of an Anonymous IBE scheme based on composite-order groups and a simple and functionalityagnostic black-boxes construction from obfuscation.
•Posted Content
Hidden Cosets and Applications to Unclonable Cryptography
TL;DR: In this paper, a copy-protection scheme with provable security in the plain model for a class of functions that is not evasive was proposed. But the construction was restricted to the case of coset states.
A new randomized message-locked encryption in the standard model
TL;DR: This paper proposes a new construction for randomized message-locked encryption (MLE) with privacy chosen-distribution attacks (PRV-CDA) and strong tag consistency (STC) securities in the standard model via UCEs.
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