Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
One-time passwords: Security analysis using BAN logic and integrating with smartcard authentication
Date
2003-01-01
Author
Bicakci, K
Baykal, Nazife
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
198
views
0
downloads
Cite This
In this paper we make a formal analysis of one-time password protocols using BAN logic and provide some guidelines to integrate securely one-time passwords with smartcard based authentication. We also propose some extensions to the BAN logic to facilitate analyzing hash chain based authentication protocols.
URI
https://hdl.handle.net/11511/56135
Journal
COMPUTER AND INFORMATION SCIENCES - ISCIS 2003
Collections
Graduate School of Informatics, Article
Suggestions
OpenMETU
Core
Truncated Impossible and Improbable Differential Analysis of ASCON
Tezcan, Cihangir (2016-02-01)
Ascon is an authenticated encryption algorithm which is recently qualified for the second-round of the Competition for Authenticated Encryption: Security, Applicability, and Robustness. So far, successful differential, differential-linear, and cube-like attacks on the reduced-round Ascon are provided. In this work, we provide the inverse of Ascon's linear layer in terms of rotations which can be used for constructing impossible differentials. We show that Ascon's S-box contains 35 undisturbed bits and we us...
Truncated, impobible, and improbable differential analysis of ASCON
Tezcan, Cihangir (2016-01-01)
ASCON is an authenticated encryption algorithm which is recently qualified for the second-round of the Competition for Authenticated Encryption: Security, Applicability, and Robustneb. So far, succebful differential, differential-linear, and cube-like attacks on the reduced-round ASCON are provided. In this work, we provide the inverse of ASCON's linear layer in terms of rotations which can be used for constructing impobible differentials. We show that ASCON's S-box contains 35 undisturbed bits and we use t...
Graphical Passwords as Browser Extension: Implementation and Usability Study
BIÇAKCI, KEMAL; Yuceel, Mustafa; Erdeniz, Burak; Gurbaslar, Hakan; ATALAY, NART BEDİN (2009-06-19)
Today, most Internet applications still establish user authentication with traditional text based passwords. Designing a secure as well as a user-friendly password-based method has been on the agenda of security researchers for a long time. On one hand, there are password manager programs which facilitate generating site-specific strong passwords from a single user password to eliminate the memory burden due to multiple passwords. On the other hand, there are studies exploring the viability of graphical pas...
Gröbner Basis Attack on STARK-Friendly Symmetric-Key Primitives: JARVIS, MiMC and GMiMCerf
Kara, Gizem; Yayla, Oğuz (2022-01-01)
A number of arithmetization-oriented ciphers emerge for use in advanced cryptographic protocols such as secure multi-party computation (MPC), fully homomorphic en-cryption (FHE) and zero-knowledge proofs (ZK) in recent years. The standard block ciphers like AES and the hash functions SHA2/SHA3 are proved to be efficient in software and hardware but not optimal to use in this field, for this reason, new kind of cryptographic primitives were proposed recently. However, unlike traditional ones, there is no sta...
Infinite length hash chains and their applications
Bicakci, K; Baykal, Nazife (2002-06-12)
Hash Chains are used extensively in various cryptography, applications such as one-time passwords, server-supported signatures and micropayments. In this paper, we present a method, called Infinite Length Hash Chains to improve the flexibility of this chaining idea by using public-key techniques. One of its distinguishing features is that communication and computation overhead of restarting of the system is avoided. For the owner of the chain it is possible to go in either way in the chain at any time witho...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
K. Bicakci and N. Baykal, “One-time passwords: Security analysis using BAN logic and integrating with smartcard authentication,”
COMPUTER AND INFORMATION SCIENCES - ISCIS 2003
, pp. 794–801, 2003, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/56135.