PRACTICAL AUDITABILITY IN TRUSTED MESSAGING SYSTEMS

Miguel Reis, Artur Romão, A. Eduardo Dias

Abstract

The success of a dispute resolution over an electronic transaction depends on the possibility of trustworthily recreating it. It is crucial to maintain a trusted, thus fully auditable, repository to which a judge could request a transaction recreation. This article presents a practical scheme providing strong guarantees about the auditability of a trusted repository. We use the messaging paradigm to present the mechanism, but it can be applied to any other scenario that needs to maintain fully auditable long term information.

References

  1. Adams, C., Cain, P., Pinkas, D., and Zuccherato, R. (2001). Time-stamp protocol (tsp). RFC 3161, Internet Engineering Task Force.
  2. Dierks, T. and Allen, C. (1999). The tls protocol version 1.0. RFC 2246, Internet Engineering Task Force.
  3. Haber, S. and Stornetta, W. S. (1997). Secure names for bitstrings. In ACM Conference on Computer and Communications Security, pages 28-35.
  4. ITU-T (2000). Itu-t recommendation x.509. Technical report, ITU-T.
  5. Krawczyk, H., Bellare, M., and Canetti, R. (1997). Hmac: Keyed-hashing for message authentication. RFC 2104, Internet Engineering Task Force.
  6. Kremer, S., Markowitch, O., and Zhou, J. (2002). An intensive survey of fair non-repudiation protocols. Computer Communications, 25(17):1606-1621.
  7. Merkle, R. C. (1980). Protocols for public key cryptosystems. In Proceedings of the IEEE Symposium on Research in Security and Privacy, pages 122-134. IEEE Computer Society Press.
  8. Myers, M., Ankney, R., Malpani, A., Galperin, S., and Adams, C. (1999). X.509 internet public key infrastructure online certificate status protocol - ocsp. RFC 2560, Internet Engineering Task Force.
  9. NIST (1994). NIST Federal Information Processing Standard Publication 180-1: Secure Hash Standard.
  10. Peha, J. M. (1999). Electronic commerce with verifiable audit trails. In Proceedings of ISOC.
  11. RSA (2000). Pkcs #10 v1.7: Certification request syntax standard. Technical report, RSA Laboratories.
  12. Schneier, B. (1995). Applied cryptography: protocols, algorithms, and source code in C. John Wiley and Sons, Inc., second edition.
  13. Zhou, J. (2001). Non-Repudiation in Electronic Commerce. Artech House, first edition.
Download


Paper Citation


in Harvard Style

Reis M., Romão A. and Eduardo Dias A. (2004). PRACTICAL AUDITABILITY IN TRUSTED MESSAGING SYSTEMS . In Proceedings of the First International Conference on E-Business and Telecommunication Networks - Volume 2: ICETE, ISBN 972-8865-15-5, pages 169-174. DOI: 10.5220/0001392001690174


in Bibtex Style

@conference{icete04,
author={Miguel Reis and Artur Romão and A. Eduardo Dias},
title={PRACTICAL AUDITABILITY IN TRUSTED MESSAGING SYSTEMS},
booktitle={Proceedings of the First International Conference on E-Business and Telecommunication Networks - Volume 2: ICETE,},
year={2004},
pages={169-174},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001392001690174},
isbn={972-8865-15-5},
}


in EndNote Style

TY - CONF
JO - Proceedings of the First International Conference on E-Business and Telecommunication Networks - Volume 2: ICETE,
TI - PRACTICAL AUDITABILITY IN TRUSTED MESSAGING SYSTEMS
SN - 972-8865-15-5
AU - Reis M.
AU - Romão A.
AU - Eduardo Dias A.
PY - 2004
SP - 169
EP - 174
DO - 10.5220/0001392001690174