[an error occurred while processing this directive]
���¿��ټ��� �߼�����
   ��ҳ  �ڿ�����  ��ί��  Ͷ��ָ��  �ڿ�����  ��������  �� �� ��  ��ϵ����
�������պ����ѧѧ�� 2002, Vol. 28 Issue (5) :589-592    DOI:
���� ����Ŀ¼ | ����Ŀ¼ | ������� | �߼����� << | >>
������, ���*
�������պ����ѧ �������ѧ�빤��ϵ
Hierarchy Requirements and Verification for Cryptographic Protocols
LIU Yi-wen, LI Wei-qin*
Beijing University of Aeronautics and Astronautics, Dept. of Computer Science and Engineering

Download: PDF (0KB)   HTML 1KB   Export: BibTeX or EndNote (RIS)      Supporting Info
ժҪ ������Э��İ�ȫ�����Ϊdz��������������2������,����������Э��ķֲ㰲ȫ����.���ý���������ʱ���߼��ķ�����������ʽ����������,����ʽ��������������Э��ķֲ㰲ȫ����.����BAN�߼���ģ�ͼ������,��Abadi-Tuttleģ�͵Ļ����Ͻ�������Э��ļ���ģ��.��Otway-ReesЭ��Ϊ��,���øü���ģ�ͺͶ���֤������������Э������˶��������֤.
Email Alert
�ؼ����� �߼�����   ��ʽ����   ����֤��   ģ�ͼ��     
Abstract�� The security requirements for cryptographic protocols were divided into shallow requirements and deep requirements. The hierarchy security requirements were illustrated. Using temporal logic and algebra, a formal requirement language was presented and used to describe the formal hierarchy requirements for cryptographic protocols. A model of computation was developed by modifying and extending the Abadi and Tuttle model, combining BAN logic and the NRL Protocol Analyzer. Using this model and theorem proving techniques, the formal requirements of the Otway-Rees protocol was verified.
Keywords�� logic algebra   formal languages   theorem proving   model checking     
Received 2001-04-23;
About author: ������(1966-),Ů,���Ͽ�����,��ʿ��,100083,����.
������, ��ΰ��.����Э��ķֲ㰲ȫ������֤[J]  �������պ����ѧѧ��, 2002,V28(5): 589-592
LIU Yi-wen, LI Wei-qin.Hierarchy Requirements and Verification for Cryptographic Protocols[J]  JOURNAL OF BEIJING UNIVERSITY OF AERONAUTICS AND A, 2002,V28(5): 589-592
http://bhxb.buaa.edu.cn//CN/     ��     http://bhxb.buaa.edu.cn//CN/Y2002/V28/I5/589
Copyright 2010 by �������պ����ѧѧ��