Non-interactive cryptocomputing for NC/sup 1/

By Tomas Sander, Adam L. Young, M. Yung. 1999

How researchers see this paper

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

Citations in the corpus

A Survey on Homomorphic Encryption Schemes (2017, methodology): “There are useful SWHE examples [Yao 1982; Sander et al. 1999; Boneh et al. 2005; Ishai and Paskin 2007] in the literature before 2009.”
Evaluating Branching Programs on Encrypted Data (2007, methodology): “Most notably, Yao’s garbled circuit technique [36, 7, 25] can handle any circuit P , allowing to computationally hide all information about P other than P(x) and the size of P . A similar result can be obtained for less powerful representation models, such as formulas or various kinds of branching p”
Improved Garbled Circuit: Free XOR Gates and Applications (2008, background): “It is known that the problem of PF-SFE can be reduced to the \regular" SFE [ 24 ,23].”
Private Searching on Streaming Data (2005, methodology): “Our notion is also superficially related to the notion of “crypto-computing” [ 27 ].”
On the (im)possibility of obfuscating programs (2001, background): “Homomorphic Encryption. A long-standing open problem in cryptography is whether homomorphic encryption schemes exist (cf., [RAD, FM, DDN, BL, SYY ]).”
Securely outsourcing linear algebra computations (2010, unknown): “A variation on SMC is Cryptocomputing [29].”
Evaluating 2-DNF Formulas on Ciphertexts (2005, background): “One exception is the system of Sander et al. [ 30 ] that provides the ability to evaluate NC1 circuits on encrypted values.”
Fully homomorphic encryption using ideal lattices (2009, background): “Sanders, Young and Yung [ 56 , 7] (SYY) use circuit-private additively homomorphic encryption to construct a circuit-private scheme that can handle NC1 circuits.”