Presentation 2007-03-16
Computationally Sound Symbolic Criteria for UC-secure Multi-Party Mutual Authentication and Key Exchange Protocols
Hirofumi MURATANI, Yoshikazu HANATANI,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Canetti and Herzog provided a method to prove computational security of cryptographi protocols by proving symbolic criteria. Here, we generalize the method from the public-key encryption functionality hybrid model to a general hybrid model. Moreover, we provide symbolic criateria for UC-secure multi-party mutual authentication and UC-secure multi-party key-exchange protocols.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) cryptographic protocol / security proof / computational soundness / Dolev-Yao model / UC-security
Paper # IT2006-95,ISEC2006-150,WBS2006-92
Date of Issue

Conference Information
Committee ISEC
Conference Date 2007/3/9(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Information Security (ISEC)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Computationally Sound Symbolic Criteria for UC-secure Multi-Party Mutual Authentication and Key Exchange Protocols
Sub Title (in English)
Keyword(1) cryptographic protocol
Keyword(2) security proof
Keyword(3) computational soundness
Keyword(4) Dolev-Yao model
Keyword(5) UC-security
1st Author's Name Hirofumi MURATANI
1st Author's Affiliation Toshiba Corporation()
2nd Author's Name Yoshikazu HANATANI
2nd Author's Affiliation Toshiba Corporation
Date 2007-03-16
Paper # IT2006-95,ISEC2006-150,WBS2006-92
Volume (vol) vol.106
Number (no) 597
Page pp.pp.-
#Pages 6
Date of Issue