OpenAlex
PricingAboutJobs
Log inGet started
Work

Lower Bounds on Obfuscation from All-or-Nothing Encryption Primitives

HTML

Year: 2017
Type: conference-paper
Source: Lecture notes in computer science
Parent work: Advances in Cryptology – CRYPTO 2017: 37th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 20–24, 2017, Proceedings, Part I
DOI: 10.1007/978-3-319-63688-7_22
Authors: Sanjam Garg, Mohammad Mahmoody, Ameer Mohammed
Institutions: University of California, Berkeley, University of Virginia
Language: English

Topic: Cryptography and Data Security
Subfield: Computer Networks and Communications
Field: Computer Science
Domain: Physical Sciences
Keywords: indistinguishability obfuscation, lower bounds, impossibility results, witness encryption, predicate encryption, fully homomorphic encryption, functional encryption, black-box reductions, self-feeding, polynomial hierarchy

Open Access status: closed
OpenAlex ID: W2731802362
FWCI: 1.915
Cites: 63
Cited by: 28
Related to: 10
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Supporters
Legal
Privacy
Accessibility
Terms
Security