Authentic data publication over the internet

被引:10
作者
Devanbu, Premkumar [1 ]
Gertz, Michael [1 ]
Martel, Charles [1 ]
Stubblebine, Stuart G. [2 ]
机构
[1] Department of Computer Science, University of California, Davis
[2] Stubblebine Consulting, LLC, Madison, NJ 07940
关键词
Merkle hash trees - Public data networks;
D O I
10.3233/JCS-2003-11302
中图分类号
学科分类号
摘要
Integrity critical databases, such as financial information used in high-value decisions, are frequently published over the Internet. Publishers of such data must satisfy the integrity, authenticity, and non-repudiation requirements of clients. Providing this protection over public data networks is an expensive proposition. This is, in part, due to the difficulty of building and running secure systems. In practice, large systems can not be verified to be secure and are frequently penetrated. The negative consequences of a system intrusion at the publisher can be severe. The problem is further complicated by data and server replication to satisfy availability and scalability requirements. To our knowledge this work is the first of its kind to give general approaches for reducing the trust required of publishers of large databases. To do this, we separate the roles of data owner and data publisher. With a few digital signatures on the part of the owner and no trust required of a publisher, we give techniques based on Merkle hash trees that publishers can use to provide authenticity and non-repudiation of the answer to database queries posed by a client. This is done without requiring a key to be held in an on-line system, thus reducing the impact of system penetrations. By reducing the trust required of the publisher, our solution is a step towards the publication of large databases in a scalable manner.
引用
收藏
页码:291 / 314
页数:23
相关论文
共 27 条
[1]  
Anagnostopoulos A., Goodrich M.T., Tamassia R., Persistent authenticated dictionaries and their applications, Proc. Information Security Conference (ISC 2001), Lecture Notes in Computer Science, 2001, 2200, pp. 379-393
[2]  
Amato N.M., Loui M.C., Checking linked data structures, Proceedings of the 24th Annual International Symposium on Fault-Tolerant Computing (FTPS), 1994, pp. 164-173
[3]  
Anderson R.J., The eternity service, Proceedings of Pragocrypt, 1996
[4]  
Berg M.D., Kreveld M.V., Overmars M., Schwarzkopf O., Computational Geometry
[5]  
Blum M., Evans W., Gemmell P., Kannan S., Noar M., Checking the inclusiveness of memories, Algorithmica, 12, 2-3, pp. 225-244, (1994)
[6]  
Bray T., Paoli J., Sperberg-McQueen C., Extensible markup language (XML) 1.0, (1998)
[7]  
Castano S., Fugini M., Martella G., Samarati P., Database Security, (1995)
[8]  
Date C.J., An Introduction to Database Systems, 7th Edn, (1999)
[9]  
Date C.J., Darwen H., A Guide to the SQL Standard, 4th Edn, (1997)
[10]  
Devanbu P., Gertz M., Kwong A., Martel C., Stubblebine S., Flexible authentication of XML documents, Proceedings of the 8th ACM Conference on Computer and Communications Security (CCS-8), ACM, 2001, pp. 136-145