scholarly journals Automated Verification of Equivalence Properties of Cryptographic Protocols

2012 ◽  
pp. 108-127 ◽  
Author(s):  
Rohit Chadha ◽  
Ştefan Ciobâcă ◽  
Steve Kremer
Keyword(s):  
Cryptographic Protocols ◽  
Automated Verification

scholarly journals Automated Verification of Equivalence on Quantum Cryptographic Protocols

10.29007/95pj ◽  
2018 ◽  
Author(s):  
Takahiro Kubota ◽  
Yoshihiko Kakutani ◽  
Go Kato ◽  
Yasuhito Kawano ◽  
Hideki Sakurada
Keyword(s):  
Formal Methods ◽  
Software Tool ◽  
Parallel Systems ◽  
Cryptographic Protocols ◽  
Automated Verification ◽  
Process Calculus ◽  
Quantum Process ◽  
Process Calculi ◽  
Security Proofs ◽  
Security Proof

t is recognized that security verification of cryptographic protocols tends to be difficult and in fact, some flaws on protocol designs or security proofs were found after they had been presented. The use of formal methods is a way to deal with such complexity. Especially, process calculi are suitable to describe parallel systems. Bisimilarity, which denotes that two processes behave indistinguishably from the outside, is a key notion in process calculi. However, by-hand verification of bisimilarity is often tedious when the processes have many long branches in their transitions. We developed a software tool to automatically verify bisimulation relation in a quantum process calculus qCCS and applied it to Shor and Preskill's security proof of BB84. The tool succeeds to verify the equivalence of BB84 and an EDP-based protocol, which are discussed in their proof.

Automated verification tool for time-dependent cryptographic protocols

2009 ◽  
Vol 29 (6) ◽  
pp. 1654-1658
Author(s):  
Xing-hua LI ◽  
Xin-feng LEI ◽  
Jun LIU
Keyword(s):  
Cryptographic Protocols ◽  
Time Dependent ◽  
Automated Verification ◽  
Verification Tool

scholarly journals Automated Verification of Equivalence Properties of Cryptographic Protocols

2016 ◽  
Vol 17 (4) ◽  
pp. 1-32 ◽  
Author(s):  
Rohit Chadha ◽  
Vincent Cheval ◽  
Ştefan Ciobâcă ◽  
Steve Kremer
Keyword(s):  
Cryptographic Protocols ◽  
Automated Verification

scholarly journals Semi-automated verification of security proofs of quantum cryptographic protocols

2016 ◽  
Vol 73 ◽  
pp. 192-220 ◽  
Author(s):  
Takahiro Kubota ◽  
Yoshihiko Kakutani ◽  
Go Kato ◽  
Yasuhito Kawano ◽  
Hideki Sakurada
Keyword(s):  
Cryptographic Protocols ◽  
Automated Verification ◽  
Security Proofs

Security Analysis of Wireless Authentication Protocols

2019 ◽  
Vol 9 (2) ◽  
pp. 247-252 ◽  
Author(s):  
Ashish Joshi ◽  
Amar Kumar Mohapatra
Keyword(s):  
Execution Time ◽  
Communication Systems ◽  
Security Analysis ◽  
Cryptographic Protocols ◽  
Command Line ◽  
Time Analysis ◽  
Authentication Protocols ◽  
Replay Attack ◽  
Peer Communication ◽  
Digital Communication Systems

Background & Objective: Cryptographic protocols had been evident method for ensuring con dentiality, Integrity and authentication in various digital communication systems. However the validation and analysis of such cryptographic protocols was limited to usage of formal mathematical models until few years back. Methods: In this paper, various popular cryptographic protocols have been studied. Some of these protocols (PAP, CHAP, and EAP) achieve security goals in peer to peer communication while others (RADIUS, DIAMETER and Kerberos) can work in multiparty environment. These protocols were validated and analysed over two popular security validation and analysis tools AVISPA and Scyther. The protocols were written according to their documentation using the HLPSL and SPDL for analysis over AVISPA and Scyther respectively. The results of these tools were analysed to nd the possible attack an each protocol. Afterwards The execution time analysis of the protocols were done by repeating the experiment for multiple iterations over the command line versions of these tools.As the literature review suggested, this research also validates that using password based protocols (PAP) is faster in terms of execution time as compared to other methods, Usage of nonces tackles the replay attack and DIAMETER is secure than RADIUS. Results and Conclusion: The results also showed us that DIAMETER is faster than RADIUS. Though Kerberos protocol was found to safe, the results tell us that it is compromisable under particular circumstances.

Sign in / Sign up

Export Citation Format

Share Document