Testable commitments
Pages 37 - 42
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]
S. Haber, Y. Hatano, Y. Honda, W. Horne, K. Miyazaki, T. Sander, S. Tezoku and D. Yao. Efficient signature schemes supporting redaction, pseudonymization, and data deidentification. In ASIACCS, 2008.
[5]
S. Halevi and S. Micali. Practical and provably-secure commitment schemes from collision-free hashing. In Proc. of Crypto'96, pp. 201--215.
[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]
R. Johnson, D. Molnar, D. Song and D. Wagner. Homomorphic signature schemes. In CT-RSA 2002.
[8]
R. Merkle. A digital signature based on a conventional encryption function. In Crypto'87, pp. 369--378.
[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]
D. Song, D. Wagner and A. Perrig. Practical Techniques for Searches on Encrypted Data. In IEEE Security and Privacy Symposium, May 2000.
[12]
J. Staddon, P. Golle and B. Zimny. Web-based inference detection. In USENIX Security 2007.
[13]
R. Steinfeld, L. Bull and Y. Zheng. Content extraction signatures. In ICISC 2001.
Index Terms
- Testable commitments
Recommendations
Courting Consensus: How Class Action Lawsuits Shape Data Privacy Rights and Obligations in the US
WPES '24: Proceedings of the 23rd Workshop on Privacy in the Electronic SocietyThe United States does not have a unified legal or regulatory framework governing data security. In the absence of clear regulations, lawsuits are a primary method by which companies that store user data face consequences for poor security practices. ...
Everlasting UC Commitments from Fully Malicious PUFs
AbstractEverlasting security models the setting where hardness assumptions hold during the execution of a protocol but may get broken in the future. Due to the strength of this adversarial model, achieving any meaningful security guarantees for composable ...
A Construction for General and Efficient Oblivious Commitment Based Envelope Protocols
Information and Communications SecurityAbstractThe notion of Oblivious Commitment Based Envelope (OCBE) was recently proposed; it enables attribute-based access control without revealing any information about the attributes. Previous OCBE protocols are designed by taking zero-knowledge proof ...
Comments
Information & Contributors
Information
Published In
Copyright © 2008 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 31 October 2008
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
CCS08: 15th ACM Conference on Computer and Communications Security 2008
October 31, 2008
Virginia, Alexandria, USA
Upcoming Conference
CCS '25
- Sponsor:
- sigsac
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 139Total Downloads
- Downloads (Last 12 months)1
- Downloads (Last 6 weeks)0
Reflects downloads up to 08 Feb 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in