作者: Sherman S. M. Chow , Kim-Kwang Raymond Choo
DOI: 10.1007/978-3-540-75496-1_14
关键词: Protocol (science) 、 Provable security 、 Anonymity 、 Computer security 、 Random oracle 、 Key-agreement protocol 、 Adversary 、 Universal composability 、 Computer science 、 Oracle
摘要: We study the provable security of identity-based (ID-based) key agreement protocols. Although several published protocols have been proven secure in random oracle model, only a weak adversarial model is considered - adversary not allowed to ask Session-Key Reveal queries that will allow learn previously established session keys. Recent research efforts devoted providing stronger level require strong assumptions, such as assuming simulator has access non-existential computational or decisional oracle. In this work, we propose an ID-based protocol and prove its widely accepted indistinguishability-based Canetti Krawczyk. our proof, does any then extend basic support ad-hoc anonymous with bilateral privacy. To best knowledge, first kind are for fixed group provide unilateral privacy (i.e., one participants enjoy anonymity).