Public-key encryption with efficient amortized updates

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6280 LNCS, Issue , 2010, Pages 17-35

  Chandran, Nishanth ^a   Ostrovsky, Rafail ^b   Skeith III, William E ^c  

^a University of California   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c CITY UNIVERSITY OF NEW YORK   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRAIC TECHNIQUES; ARBITRARY CONSTANTS; BILINEAR MAP; BLACK BOXES; COMMUNICATION COMPLEXITY; CRYPTOGRAPHIC PRIMITIVES; CRYPTOSYSTEMS; DATABASE MODIFICATION; DATABASE SIZE; DECISION PROBLEMS; ENCRYPTED DATA; HOMOMORPHIC-ENCRYPTIONS; IN-BUILDINGS; OTHER APPLICATIONS; PRIVATE DATABASE; PRIVATE KEY; PUBLIC KEYS; PUBLIC-KEY ENCRYPTION; PUBLIC-KEY ENCRYPTION SCHEME; SINGLE-BIT;

COMMUNICATION; DATABASE SYSTEMS; PUBLIC KEY CRYPTOGRAPHY; QUERY PROCESSING;

NETWORK SECURITY;

EID: 77958041310     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15317-4_2     Document Type: Conference Paper

References (21)

1. Benaloh, J.C., Yung, M.: Distributing the power of a government to enhance the privacy ofvoters. In: PODC 1986: Proceedings of the fifth annual ACM symposium on Principles of distributed computing, pp. 52-62. ACM, New York (1986)
2. Boneh, D., Goh, E.-J., Nissim, K.: Evaluating 2-DNF formulas on ciphertexts. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 325-341. Springer, Heidelberg (2005)
3. Boneh, D., Kushilevitz, E., Ostrovsky, R., Skeith, W.E.: Public key encryption that allows PIR queries. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol. 4622, pp. 50-67. Springer, Heidelberg (2007)
4. Capalbo, M.R., Reingold, O., Vadhan, S.P., Wigderson, A.: Randomness conduc-tors and constant-degree lossless expanders. In: IEEE Conference on Computa-tional Complexity, p. 15 (2002) (Pubitemid 34691882)
5. Cohen, J.D., Fischer, M.J.: A robust and verifiable cryptographically secure elec-tion scheme. In: Symposium on Foundations of Computer Science, pp. 372-382 (1985)
6. Cramer, R., Franklin, M.K., Schoenmakers, B., Yung, M.: Multi-autority secret-ballot elections with linear work. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 72-83. Springer, Heidelberg (1996)
7. Cramer, R., Gennaro, R., Schoenmakers, B.: A secure and optimally efficient multi-authority election scheme. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 103-118. Springer, Heidelberg (1997) (Pubitemid 127067797)
8. Damgard, I., Jurik, M.: Efficient protocols based on probabilistic encryption using composite degree residue classes (2000)
9. Gentry, C.: Fully homomorphic encryption using ideal lattices. In: STOC, pp. 169-178 (2009)
10. Goldreich, O.: Foundations ofCryptography: Basic Applications, vol. 2. Cambridge University Press, New York (2004)
11. Guruswami, V., Umans, C., Vadhan, S.P.: Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes. In: IEEE Conference on Computational Complexity, pp. 96-108 (2007)
12. Hoory, S., Linial, N., Wigderson, A.: Expander graphs and their applications. Bull. Amer. Math. Soc. 43, 439-561 (2006)
13. Ishai, Y., Kushilevitz, E., Ostrovsky, R., Sahai, A.: Batch codes and their applica-tions. In: STOC 2004, pp. 262-271 (2004)
14. Ishai, Y., Kushilevitz, E., Ostrovsky, R., Sahai, A.: Cryptography with constant computational overhead. In: STOC 2008, pp. 433-442 (2008)
15. Katz, J., Myers, S., Ostrovsky, R.: Cryptographic counters and applications to electronic voting. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol. 2045, pp. 78-92. Springer, Heidelberg (2001)
16. Lipmaa, H.: Private branching programs: On communication-efficient cryptocom-puting. Cryptology ePrint Archive, Report 2008/107 (2008), http://eprint.iacr.org/2008/107
17. Ostrovsky, R., Skeith, W.E.: Communication complexity in algebraic two-party protocols. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 379-396. Springer, Heidelberg (2008)
18. Schoenmakers, B.: A simple publicly verifiable secret sharing scheme and its ap-plication to electronic. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 148-164. Springer, Heidelberg (1999)
19. Sipser, M., Spielman, D.A.: Expander codes. IEEE Transactions on Information Theory 42(6), 1710-1722 (1996)
20. Ta-Shma, A., Umans, C., Zuckerman, D.: Lossless condensers, unbalanced ex-panders, and extractors. Combinatorica 27(2), 213-240 (2007)
21. Yao, A.C.-C.: Protocols for secure computations (extended abstract). In: FOCS 1982, pp. 160-164 (1982)