Witness encryption and its applications

By Sanjam Garg, Craig Gentry, Amit Sahai, Brent Waters. Symposium on the Theory of Computing, 2013

362 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits (2014, background): “A completely diﬀerent approach to building circuit ABE was presented by Garg, Gentry, Sahai, and Waters [GGSW13] who showed that a general primitive they named witness encryption implies circuit ABE when combined with witness indistinguishable proofs.”
Candidate Indistinguishability Obfuscation and Functional Encryption for all Circuits (2013, background): “Recent breakthrough works [16], [17], [18] show how to achieve ABE for arbitrary circuits F , however these constructions do not provide any secrecy for the x input.”
Multi-Input Functional Encryption (2014, background): “) The past few years have seen steady progress toward constructing predicate encryption schemes [24, 19, 18, 20] and FE schemes [31, 23, 21, 20] with greater expressiveness and collusion resistance, culminating in the recent work of Garg et al.”
Fairness in an Unfair World: Fair Multiparty Computation from Public Bulletin Boards (2017, background): “Candidate constructions of WE for NP [37, 39] are known from multilinear maps [36].”