Efficient consistency proofs for generalized queries on a committed database

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

Volumn 3142, Issue , 2004, Pages 1041-1053

  Ostrovsky, Rafail ^a   Rackoff, Charles ^b   Smith, Adam ^c  

^a University of California   (United States)

^b UNIVERSITY OF TORONTO   (Canada)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; DATABASE SYSTEMS; FORESTRY; POLYNOMIAL APPROXIMATION; QUERY LANGUAGES; TREES (MATHEMATICS);

DATABASE KEYS; EFFICIENT PROTOCOLS; HASH TREES; POLYNOMIAL-TIME; RANGE QUERY; ROBUST ALGORITHM; ROBUSTNESS PROPERTIES; ZERO KNOWLEDGE PROOF;

QUERY PROCESSING;

EID: 35048885162     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27836-8_87     Document Type: Article

References (20)

1. B. Barak and O. Goldreich. Universal Arguments. In Proc. Complexity (CCC) 2002.
2. J. L. Bentley. Multidimensional divide-and-conquer. Comm. ACM, 23:214-229, 1980.
3. A Buldas, P. Laud and H. Lipmaa. Eliminating Counterevidence with Applications to Accountable Certificate Management. J. Computer Security, 2002. (Originally in CCS 2000.)
4. A. Buldas, M. Roos, J. Willemson. Undeniable Replies to Database Queries. In DBIS 2002.
5. I. B. Damgård, T. P. Pedersen, and B. Pfitzmann. On the existence of statistically hiding bit commitment schemes and fail-stop signatures. In CRYPTO '93, pp. 22-26.
6. A. De Santis and G. Persiano Zero-Knowledge Proofs of Knowledge Without Interaction (Extended Abstract). In Proc. of FOCS 1992, pp. 427-436.
7. J. Goodman and J. O'Rourke, editors. Handbook of Discrete and Computational Geometry. CRC Press, 1997.
8. M. T. Goodrich, R. Tamassia, N. Triandopoulos and R. Cohen. Authenticated Data Structures for Graph and Geometric Searching. In Proc. RSA Conference, Cryptographers'Track, 2003.
9. A. Healy, A. Lysyanskaya, T. Malkin, L. Reyzin. Zero-Knowledge Sets from General Assumptions. Manuscript, March 2004.
10. J. Kilian. A note on efficient zero-knowledge proofs and arguments. In 24th STOC, 1992.
11. J. Kilian. Efficiently committing to databases. Technical report, NEC Research, 1998.
12. P. Maniatis and M. Baker. Authenticated Append-only Skip Lists. ArXiv e-print cs.CR/0302010, February, 2003.
13. C. Martel, G. Nuckolls, M. Gertz, P. Devanbu, A. Kwong, S. Stubblebine. A General Model for Authentic Data Publication. Manuscript, 2003.
14. S. Micali, M. Rabin and J. Kilian. Zero-Knowledge Sets. In Proc. FOCS 2003.
15. S. Micali. Computationally Sound Proofs. SIAM J. Computing, 30(4):1253-1298, 2000.
16. S. Micali and M. Rabin. Accessing personal data while preserving privacy. Talk announcement (1997), and personal communication with M. Rabin (1999).
17. R. Merkle A digital signature based on a conventional encryption function. In CRYPTO '87, pp. 369-378, 1988.
18. M. Naor and K. Nissim. Certificate Revocation and Certificate Update. In 7th USENlXSecurity Symposium, 1998.
19. M. Naor, M. Yung. Universal One-Way Hash Functions and their Cryptographic Applications. In 21st STOC, 1989.
20. R. Ostrovsky, C. Rackoff, A. Smith. Efficient Consistency Proofs on a Committed Database MIT LCS Technical Report TR-887. Feb 2003. See http://www.lcs.mit.edu/publications