Testable commitments

ABSTRACT

A key challenge in litigation is verifying that all relevant case content has been produced. Adding to the challenge is the fact that litigating parties are both bound to produce relevant documents and bound to protect private information (e.g. medical information). This leaves open the possibility of withholding content inappropriately, and verifying that this has not occurred is a time-consuming process involving the presiding judge. We introduce testable commitments: a cryptographic technique for verifying that only the right information has been withheld with only minimal involvement from a trusted third party. We present a construction of testable commitments and discuss its implementation.

REFERENCES

• 1: G. Ateniese, D. Chou, B. de Medeiros and G. Tsudik. Sanitizable signatures. In ESORICS 2005.
• 2: T. Dierks and C. Allen. The TLS Protocol, IETF RFC2246, January 1999.
• 3: GATE: General Architecture for Text Engineering. On the web at http://gate.ac.uk/projects.html
• 4: Stuart Haber , Yasuo Hatano , Yoshinori Honda , William Horne , Kunihiko Miyazaki , Tomas Sander , Satoru Tezoku , Danfeng Yao, Efficient signature schemes supporting redaction, pseudonymization, and data deidentification, Proceedings of the 2008 ACM symposium on Information, computer and communications security, March 18-20, 2008, Tokyo, Japan [doi>10.1145/1368310.1368362]
• 5: Shai Halevi , Silvio Micali, Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing, Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology, p.201-215, August 18-22, 1996
• 6: Health Insurance Portability and Accountability Act of 1996. Public Law 104--191, 104th Congress.http://www.cms.hhs.gov/HIPAAGenInfo/Downloads/HIPAALaw.pdf
• 7: Robert Johnson , David Molnar , Dawn Xiaodong Song , David Wagner, Homomorphic Signature Schemes, Proceedings of the The Cryptographer's Track at the RSA Conference on Topics in Cryptology, p.244-262, February 18-22, 2002
• 8: Ralph C. Merkle, A Digital Signature Based on a Conventional Encryption Function, A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology, p.369-378, August 16-20, 1987
• 9: M. Naor. Bit commitment using pseudorandomness. In Journal of Cryptology, 1991.
• 10: Pennsylvania Superior Court, Appeal form the order of January 31, 2000. Filed February 8, 2001. Appellant, George A. Spisak, Jr., Appellee, Margolis Edelstein.
• 11: Dawn Xiaodong Song , David Wagner , Adrian Perrig, Practical Techniques for Searches on Encrypted Data, Proceedings of the 2000 IEEE Symposium on Security and Privacy, p.44, May 14-17, 2000
• 12: Jessica Staddon , Philippe Golle , Bryce Zimny, Web-based inference detection, Proceedings of 16th USENIX Security Symposium on USENIX Security Symposium, p.1-16, August 06-10, 2007, Boston, MA
• 13: Ron Steinfeld , Laurence Bull , Yuliang Zheng, Content Extraction Signatures, Proceedings of the 4th International Conference Seoul on Information Security and Cryptology, p.285-304, December 06-07, 2001

INDEX TERMS

Primary Classification:
  K. Computing Milieux
  K.6 MANAGEMENT OF COMPUTING AND INFORMATION SYSTEMS
      K.6.5 Security and Protection (D.4.6, K.4.2)

General Terms:
Security

Keywords:
commitment scheme, discovery, litigation, privacy, responsive content