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
Identity/attribute-based authentication protocols based on pairings
Download
index.pdf
Date
2020-10-22
Author
Öztürk, Gülnihal
Metadata
Show full item record
Item Usage Stats
643
views
155
downloads
Cite This
Authentication is one of the most important goals in cryptography. It provides sharing information with only authorized people and protecting data from being modified. Authentication can be achieved in various ways such as password-based, symmetric-key and public-key. The public-key authentication is the most preferred one among these options. It provides construction of key pairs and verification with based on hard mathematical problems. Public-key authentication is used as a basis for two important ideas: Identity-Based Authentication (IBA) and Attribute-Based Authentication (ABA). The IBA systems are actually specialized publickey encryption systems where the public key i s generated using the user identity information. ABA systems, which are the other important idea, are the generalizations of the IBA systems. While IBA systems cover only one attribute about users, ABA systems cover more than one attribute. In this thesis, identity-based and attribute-based authentication protocols are analyzed, and a new attribute-based authentication protocol is proposed. First, it is given the details and comparison of ID-based authentication protocols Shim, Yuan and Li [37], Tseng 2017 [35] and Tseng 2015 [34], which are based on elliptic curve. Shim, Yuan and Li [37] and Tseng 2017 [35] use pairings for authentication, while Tseng 2015 [34] uses hash functions. Their securities and performances are analyzed. They provide the security properties such as known-key security, forward secrecy, key-compromise impersonation and unknown-key share. They also resist the passive, man-in-the-middle and reveal attacks. The protocols are more efficient than the protoco ls which are based on public-key by virtue of elliptic curve. Tseng 2015 [34] is the most efficient one among them since it uses only hash functions. Also, the Zhang, Mu and Zhang [41] attribute-based authentication protocol is studied. Then a new protocol, which is inspired by it, is designed. While Zhang et al. [41] is based on public key, the new protocol is constructed on elliptic curve basis. Moreover, controlling of attributes is simplified. It decreases the number of operations to determine the necessary attributes. In this way, the computational cost is reduced. The new protocol’s security analysis is presented and showed that the protocol is resistant to the following attack scenarios; adaptive chosen ciphertext, keycompromise impersonation, probing resistance, indistinguishable to eavesdroppers, forward secrecy and unknown key-share.
Subject Keywords
Id-based authentic ation
,
Attribute-based authentication
,
Pairing-based cryptography
URI
https://hdl.handle.net/11511/69074
Collections
Graduate School of Applied Mathematics, Thesis
Suggestions
OpenMETU
Core
Privacy preserving database external layer construction algorithm via secure decomposition for attribute-based security policies
Turan, Uğur; Toroslu, İsmail Hakkı; Kantarcıoğlu, Murat; Department of Computer Engineering (2018)
Relational DBMS’scontinue to dominate th emarket an dinference problem on external schema has preserved its importance in terms of data privacy. Especially for the last 10 years, external schema construction for application-specific database usage has increased its independency from the conceptual schema, as the definitions and implementations of views and procedures have been optimized. After defining all mathematical background, this work offers an optimized decomposition strategy for the external schema, wh...
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...
NEW TMVP-BASED MULTIPLICATION ALGORITHMS FOR POLYNOMIAL QUOTIENT RINGS AND APPLICATION TO POST-QUANTUM CRYPTOGRAPHY
Keskinkurt Paksoy, İrem; Cenk, Murat; Department of Cryptography (2022-7-28)
One of the quantum-safe cryptography research areas is lattice-based cryptography. Most lattice-based schemes need efficient algorithms for multiplication in polynomial quotient rings. The fastest algorithm known for multiplication is the Number Theoretic Transform (NTT), which requires certain restrictions on the parameters of the ring, such as prime modulus. Direct NTT application is not an option for some schemes that do not comply with these restrictions, e.g., the two finalists of the PQC standardizati...
Advanced methods for diversification of results in general-purpose and specialized search engines
Yiğit Sert, Sevgi; Altıngövde, İsmail Sengör; Ulusoy, Özgür; Department of Computer Engineering (2020-12-28)
Diversifying search results is a common mechanism in information retrieval to satisfy more users by surfacing documents that address different possible intentions of users. It aims to generate a result list that is both relevant and diverse when ambiguous and/or broad queries appear. Such queries have different underlying subtopics (a.k.a., aspects or interpretations) that search result diversification algorithms should consider. In this thesis, we first address search result diversification as a useful met...
Smart water chain: Immutable, distributed and decentralized water transaction ledgers
Satilmisoglu, Talat Kemal; Keskin, Huzur (2023-01-01)
Blockchain is a transactional data storage system where data can be stored reliably without the need for a central database or trusted authority. The data can be anything like financial transactions, supply chain processes or medical records. It is similar to a classical database but uses a decentralized ledger and allowing each participant in the network to have their own copy of the ledger and be able to see all transactions. Data stored in the distributed ledger can only be read or written, not deleted o...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
G. Öztürk, “Identity/attribute-based authentication protocols based on pairings,” M.S. - Master of Science, Middle East Technical University, 2020.