Non-repudiation is a basic security requirement for electronic business applications to protect against a sender's false denial of having created and sent a message. Typically non-repudiation protocols are constructed based on digital signatures. However, there has been no theoretical treatment of such non-repudiation protocols. In this paper, we provide a formal security definition of non-repudiation protocols and analyze the security of a signature-based protocol. Our security definition and analysis are based on Canetti's framework of universally composable security.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Satoshi HADA, "A Formal Treatment of Non-repudiation Protocols" in IEICE TRANSACTIONS on Fundamentals,
vol. E87-A, no. 2, pp. 461-470, February 2004, doi: .
Abstract: Non-repudiation is a basic security requirement for electronic business applications to protect against a sender's false denial of having created and sent a message. Typically non-repudiation protocols are constructed based on digital signatures. However, there has been no theoretical treatment of such non-repudiation protocols. In this paper, we provide a formal security definition of non-repudiation protocols and analyze the security of a signature-based protocol. Our security definition and analysis are based on Canetti's framework of universally composable security.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1587/e87-a_2_461/_p
Copy
@ARTICLE{e87-a_2_461,
author={Satoshi HADA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Formal Treatment of Non-repudiation Protocols},
year={2004},
volume={E87-A},
number={2},
pages={461-470},
abstract={Non-repudiation is a basic security requirement for electronic business applications to protect against a sender's false denial of having created and sent a message. Typically non-repudiation protocols are constructed based on digital signatures. However, there has been no theoretical treatment of such non-repudiation protocols. In this paper, we provide a formal security definition of non-repudiation protocols and analyze the security of a signature-based protocol. Our security definition and analysis are based on Canetti's framework of universally composable security.},
keywords={},
doi={},
ISSN={},
month={February},}
Copy
TY - JOUR
TI - A Formal Treatment of Non-repudiation Protocols
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 461
EP - 470
AU - Satoshi HADA
PY - 2004
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E87-A
IS - 2
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - February 2004
AB - Non-repudiation is a basic security requirement for electronic business applications to protect against a sender's false denial of having created and sent a message. Typically non-repudiation protocols are constructed based on digital signatures. However, there has been no theoretical treatment of such non-repudiation protocols. In this paper, we provide a formal security definition of non-repudiation protocols and analyze the security of a signature-based protocol. Our security definition and analysis are based on Canetti's framework of universally composable security.
ER -