Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Security Enhancement of Identity-Based Identification with Reversibility

Atsushi Fujioka, Taiichi Saito, Keita Xagawa

Published Jan 1, 2012• 2 citations
Publisher
DOI
10.1007/978-3-642-34129-8_18

Related papers

Security Enhancements by OR-Proof in Identity-Based Identification

Atsushi Fujioka, Taiichi Saito, Keita Xagawa

Lecture notes in computer science•Jan 1, 2012•15 citations

Secure Hierarchical Identity-Based Identification without Random Oracles

Atsushi Fujioka, Taiichi Saito, Keita Xagawa

Lecture notes in computer science•Jan 1, 2012•3 citations

A secure identification system using coherent states

Guangqiang He, Zeng Gui-Hua

A quantum identification system based on the transformation of polarization of a mesoscopic coherent state is proposed. Physically, an initial polarization state which carries the identity information is transformed into an arbitrary elliptical polarization state. To verify the identity of a communicator, a reverse procedure is performed by the receiver. For simply describing the transformation procedure, the analytical methods of Poincaré sphere and quaternion are adopted. Since quantum noise provides such a measurement uncertainty for the eavesdropping that the identity information cannot be retrieved from the elliptical polarization state, the proposed scheme is secure.

Chinese Physics•Jan 16, 2006•3 citations

Identity-Based Identity-Concealed Authenticated Key Exchange

Huanhuan Lian, Tianyu Pan, Huige Wang +1 more

Lecture notes in computer science•Jan 1, 2021•10 citations

Cryptographic protocols for security and identification

Richard E. Blahut

The methods of cryptography can be successful only if they are properly incorporated into an application. A cryptographic technique can be unbreakable as such, and yet could still be insecure if it is used unwisely. This observation motivates the subject of security protocols. A security protocol consists of a formal method of using a cryptographic technique in a practical application. Without a well-defined security protocol, a perfectly secure cryptographic technique could be compromised by its use. We do not draw a sharp distinction between the topic of secrecy and the topic of security. The two are closely related, and it is not helpful to attempt to draw a sharp line between them. In this context, a primitive is a basic method of obtaining secrecy and a protocol is a body of rules for using that primitive. In this chapter we will also study other forms of information protection such as identification and secret sharing that can be regarded as topics closely related to security protocols. The topic of identification deals with methods for establishing the identity of the source of a transmission. This is a subtle and difficult topic because the very concept of identity is vague and subjective. The identity of an isolated individual or device may be self-defined and subject to no outside verification. That identity is useful only to establish that all messages in a sequence of messages are from the same entity.

Cambridge University Press eBooks•Mar 27, 2014•0 citations

Identity-Based Encryption

Jiang Zhang, Zhenfeng Zhang

Springer eBooks•Jan 1, 2020•1 citation
A quantum identification system based on the transformation of polarization of a mesoscopic coherent state is proposed. Physically, an initial polarization state which carries the identity information is transformed into an arbitrary elliptical polarization state. To verify the identity of a communicator, a reverse procedure is performed by the receiver. For simply describing the transformation procedure, the analytical methods of Poincaré sphere and quaternion are adopted. Since quantum noise provides such a measurement uncertainty for the eavesdropping that the identity information cannot be retrieved from the elliptical polarization state, the proposed scheme is secure.
The methods of cryptography can be successful only if they are properly incorporated into an application. A cryptographic technique can be unbreakable as such, and yet could still be insecure if it is used unwisely. This observation motivates the subject of security protocols. A security protocol consists of a formal method of using a cryptographic technique in a practical application. Without a well-defined security protocol, a perfectly secure cryptographic technique could be compromised by its use. We do not draw a sharp distinction between the topic of secrecy and the topic of security. The two are closely related, and it is not helpful to attempt to draw a sharp line between them. In this context, a primitive is a basic method of obtaining secrecy and a protocol is a body of rules for using that primitive. In this chapter we will also study other forms of information protection such as identification and secret sharing that can be regarded as topics closely related to security protocols. The topic of identification deals with methods for establishing the identity of the source of a transmission. This is a subtle and difficult topic because the very concept of identity is vague and subjective. The identity of an isolated individual or device may be self-defined and subject to no outside verification. That identity is useful only to establish that all messages in a sequence of messages are from the same entity.