CT-RSA '02 Proceedings of the The Cryptographer's Track at the RSA Conference on Topics in Cryptology
ICISC '01 Proceedings of the 4th International Conference Seoul on Information Security and Cryptology
A Digital Signature Based on a Conventional Encryption Function
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Practical Techniques for Searches on Encrypted Data
SP '00 Proceedings of the 2000 IEEE Symposium on Security and Privacy
SS'07 Proceedings of 16th USENIX Security Symposium on USENIX Security Symposium
Efficient signature schemes supporting redaction, pseudonymization, and data deidentification
Proceedings of the 2008 ACM symposium on Information, computer and communications security
ESORICS'05 Proceedings of the 10th European conference on Research in Computer Security
| Hi-index | 0.00 |
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.