-
1
-
-
0023985196
-
Rsa and rabin functions: Certain parts are as hard as the whole
-
Alexi, W., Chor, B., Goldreich, O., Schnorr, C.-P.: Rsa and rabin functions: Certain parts are as hard as the whole. SIAM J. Comput. 17(2), 194-209 (1988)
-
(1988)
SIAM J. Comput.
, vol.17
, Issue.2
, pp. 194-209
-
-
Alexi, W.1
Chor, B.2
Goldreich, O.3
Schnorr, C.-P.4
-
2
-
-
0346707588
-
On the multiplicative complexity of boolean functions over the basis (∧, ⊕, 1)
-
Boyar, J., Peralta, R., Pochuev, D.: On the multiplicative complexity of boolean functions over the basis (∧, ⊕, 1). Theor. Comput. Sci. 235(1), 43-57 (2000)
-
(2000)
Theor. Comput. Sci.
, vol.235
, Issue.1
, pp. 43-57
-
-
Boyar, J.1
Peralta, R.2
Pochuev, D.3
-
3
-
-
1642602228
-
Computationally private information retrieval with polylogarithmic communication
-
Stern, J. (ed.) EUROCRYPT 1999. Springer, Heidelberg
-
Cachin, C., Micali, S., Stadler, M.: Computationally private information retrieval with polylogarithmic communication. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 402-414. Springer, Heidelberg (1999)
-
(1999)
LNCS
, vol.1592
, pp. 402-414
-
-
Cachin, C.1
Micali, S.2
Stadler, M.3
-
4
-
-
0001494997
-
Small solutions to polynomial equations, and low exponent RSA vulnerabilities
-
Coppersmith, D.: Small solutions to polynomial equations, and low exponent RSA vulnerabilities. J. Cryptology 10(4), 233-260 (1997)
-
(1997)
J. Cryptology
, vol.10
, Issue.4
, pp. 233-260
-
-
Coppersmith, D.1
-
6
-
-
70350642087
-
Fully homomorphic encryption using ideal lattices
-
ACM, New York
-
Gentry, C.: Fully homomorphic encryption using ideal lattices. In: STOC 2009, pp. 169-178. ACM, New York (2009)
-
(2009)
STOC 2009
, pp. 169-178
-
-
Gentry, C.1
-
8
-
-
0345253860
-
A pseudorandom generator from any one-way function
-
Håstad, J., Impagliazzo, R., Levin, L.A., Luby, M.: A pseudorandom generator from any one-way function. SIAM J. Comput. 28(4), 1364-1396 (1999)
-
(1999)
SIAM J. Comput.
, vol.28
, Issue.4
, pp. 1364-1396
-
-
Håstad, J.1
Impagliazzo, R.2
Levin, L.A.3
Luby, M.4
-
9
-
-
84958958450
-
Approximate integer common divisors
-
Silverman, J.H. (ed.) CaLC 2001. Springer, Heidelberg
-
Howgrave-Graham, N.: Approximate integer common divisors. In: Silverman, J.H. (ed.) CaLC 2001. LNCS, vol. 2146, pp. 51-66. Springer, Heidelberg (2001)
-
(2001)
LNCS
, vol.2146
, pp. 51-66
-
-
Howgrave-Graham, N.1
-
10
-
-
38049046515
-
Evaluating branching programs on encrypted data
-
Vadhan, S.P. (ed.) TCC 2007. Springer, Heidelberg
-
Ishai, Y., Paskin, A.: Evaluating branching programs on encrypted data. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol. 4392, pp. 575-594. Springer, Heidelberg (2007)
-
(2007)
LNCS
, vol.4392
, pp. 575-594
-
-
Ishai, Y.1
Paskin, A.2
-
12
-
-
0004285345
-
-
3rd edn. The Art of Computer Programming, Addison-Wesley, Reading
-
Knuth, D.E.: Seminumerical Algorithms, 3rd edn. The Art of Computer Programming, vol. 2. Addison-Wesley, Reading (1997)
-
(1997)
Seminumerical Algorithms
, vol.2
-
-
Knuth, D.E.1
-
13
-
-
0022012583
-
The computational complexity of simultaneous diophantine approximation problems
-
Lagarias, J.C.: The computational complexity of simultaneous diophantine approximation problems. SIAM J. Comput. 14(1), 196-209 (1985)
-
(1985)
SIAM J. Comput.
, vol.14
, Issue.1
, pp. 196-209
-
-
Lagarias, J.C.1
-
14
-
-
0023366347
-
Factoring multivariate polynomials over algebraic number fields
-
Lenstra, A.K.: Factoring multivariate polynomials over algebraic number fields. SIAM J. Comput. 16(3), 591-598 (1987)
-
(1987)
SIAM J. Comput.
, vol.16
, Issue.3
, pp. 591-598
-
-
Lenstra, A.K.1
-
15
-
-
64249101946
-
A proof of security of yao's protocol for two-party computation
-
Lindell, Y., Pinkas, B.: A proof of security of yao's protocol for two-party computation. J. Cryptology 22(2) (2009)
-
(2009)
J. Cryptology
, vol.22
, Issue.2
-
-
Lindell, Y.1
Pinkas, B.2
-
16
-
-
84946830399
-
On the insecurity of a server-aided RSA protocol
-
Boyd, C. (ed.) ASIACRYPT 2001. Springer, Heidelberg
-
Nguyen, P.Q., Shparlinski, I.: On the insecurity of a server-aided RSA protocol. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 21-35. Springer, Heidelberg (2001)
-
(2001)
LNCS
, vol.2248
, pp. 21-35
-
-
Nguyen, P.Q.1
Shparlinski, I.2
-
17
-
-
33846867921
-
The two faces of lattices in cryptology
-
Silverman, J.H. (ed.) CaLC 2001. Springer, Heidelberg
-
Nguyen, P.Q., Stern, J.: The two faces of lattices in cryptology. In: Silverman, J.H. (ed.) CaLC 2001. LNCS, vol. 2146, pp. 146-180. Springer, Heidelberg (2001)
-
(2001)
LNCS
, vol.2146
, pp. 146-180
-
-
Nguyen, P.Q.1
Stern, J.2
-
18
-
-
33646821378
-
Adapting density attacks to low-weight knapsacks
-
Roy, B. (ed.) ASIACRYPT 2005. Springer, Heidelberg
-
Nguyen, P.Q., Stern, J.: Adapting density attacks to low-weight knapsacks. In: Roy, B. (ed.) ASIACRYPT 2005. LNCS, vol. 3788, pp. 41-58. Springer, Heidelberg (2005)
-
(2005)
LNCS
, vol.3788
, pp. 41-58
-
-
Nguyen, P.Q.1
Stern, J.2
-
19
-
-
20444451186
-
New lattice-based cryptographic constructions
-
Regev, O.: New lattice-based cryptographic constructions. JACM 51(6), 899-942 (2004)
-
(2004)
JACM
, vol.51
, Issue.6
, pp. 899-942
-
-
Regev, O.1
-
20
-
-
0005301490
-
On data banks and privacy homomorphisms
-
Academic Press, London
-
Rivest, R., Adleman, L., Dertouzos, M.: On data banks and privacy homomorphisms. In: Foundations of Secure Computation, pp. 169-177. Academic Press, London (1978)
-
(1978)
Foundations of Secure Computation
, pp. 169-177
-
-
Rivest, R.1
Adleman, L.2
Dertouzos, M.3
-
21
-
-
77954631631
-
-
Cryptology ePrint Archive, Report 2009/616
-
van Dijk, M., Gentry, C., Halevi, S., Vaikuntanathan, V.: Fully homomorphic encryption over the integers. Cryptology ePrint Archive, Report 2009/616 (2009), http://eprint.iacr.org/2009/616
-
(2009)
Fully Homomorphic Encryption over the Integers
-
-
Van Dijk, M.1
Gentry, C.2
Halevi, S.3
Vaikuntanathan, V.4
|