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

By Dan Boneh, Mark Zhandry. Algorithmica, 2014

295 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computer Networks and Communications, Computer Vision and Pattern Recognition

View Paper: https://www.semanticscholar.org/paper/e4f10b0b558ec40f3847f29d02ffc3473d99b3e7

How researchers see this paper

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

In Artificial Intelligence

1. Salil P. Vadhan
2. Jonathan Ullman
3. Thomas Steinke
4. Mark Bun
5. Abhradeep Thakurta
6. Vitaly Feldman
7. Adam D. Smith
8. Gautam Kamath

In Computer Networks and Communications

1. Salil P. Vadhan

In Computer Vision and Pattern Recognition

1. Salil P. Vadhan

Citations in the corpus

• The Complexity of Differential Privacy (2017, background): “Recently, however, there are candidate constructions of traitor-tracing schemes with ciphertext length ` = poly(d), independent of n, assuming the existence of one-way functions and either “secure multilinear maps” or “indistinguishability obfuscation” [51, 16].”