Reusable garbled circuits and succinct functional encryption

441 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.

Succinct Non-Interactive Zero Knowledge for a von Neumann Architecture (2014, background): “Fully-homomorphic encryption (FHE) [39] and probabilistically-checkable proofs [5, 4] are powerful tools that are often used in protocols for outsourcing computations (with integrity or confidentiality guarantees, or both) [49, 54, 2, 37, 31, 47, 41].”
Two Halves Make a Whole - Reducing Data Transfer in Garbled Circuits Using Half Gates (2015, background): “, [9]) which are arguably impractical and already ruled out by restricting our focus to Minicrypt.”
BlindBox: Deep Packet Inspection over Encrypted Traffic (2015, background): “At a first glance, it may appear that these two properties are fundamentally at odds with each other: how can a network appliance make decisions based on connection contents when it cannot see these contents?”
Multi-Input Functional Encryption (2014, background): “Indeed further research in single-key security for functional encryption has largely focused on efficiency issues [11] such as succinctness of ciphertexts, that enable new applications.”
How to Construct Quantum Random Functions (2012, background): “It also has numerous other applications throughout cryptography such as giving fully homomorphic encryption [16, 21], functional encryption [25], and certain types of program obfuscation [26, 42].”