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 Enhancements by OR-Proof in Identity-Based Identification

Atsushi Fujioka, Taiichi Saito, Keita Xagawa

Published Jan 1, 2012• 15 citations
Publisher
DOI
10.1007/978-3-642-31284-7_9

Related papers

Security Enhancement of Identity-Based Identification with Reversibility

Atsushi Fujioka, Taiichi Saito, Keita Xagawa

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

Applicability of OR-Proof Techniques to Hierarchical Identity-Based Identification

Atsushi Fujioka, Taiichi Saito, Keita Xagawa

Lecture notes in computer science•Jan 1, 2012•6 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

An improved identity-based key agreement protocol and its security proof

S WANG, Zhenfu Cao, Kim‐Kwang Raymond Choo +1 more

Information Sciences•Oct 5, 2008•58 citations

An RFID Grouping-proof Protocol with Privacy Protection and Forward Security

Zhicai Shi, Yihan Wang, Zhang Xiao-mei +2 more

The Radio Frequency Identification(RFID) grouping-proof protocol is used to verify whether there are multiple tags,because in actual scenario,these tags are used for the identification of one object.However,due to the simple structure and limited computing and storage resources of the RFID tags,the security protocol is difficult to achieve.To address this problem,this paper proposes a grouping-proof protocol that insures privacy and forward security.First,this paper uses hash function and randomization to guarantee the confidentiality and privacy of each session.Then,by means of activate-sleep mechanism,filter-response mechanism and the combination of identity authentication and grouping-proof technology,the efficiency of protocol is improved.Analysis results show that the RFID grouping-proof protocol meets the requirements of anonymity and forward security,so it can prevent eavesdropping,tracking attack,replay attack and de-synchronize attack.

Jisuanji gongcheng•Jan 1, 2020•0 citations

Quantum-Safe Identity Verification using Relativistic Zero-Knowledge Proof Systems

Yao Ma, Wen Yu Kon, Chu, Jefferson +3 more

Identity verification is the process of confirming an individual's claimed identity, which is essential in sectors like finance, healthcare, and online services to ensure security and prevent fraud. However, current password/PIN-based identity solutions are susceptible to phishing or skimming attacks, where malicious intermediaries attempt to steal credentials using fake identification portals. Alikhani et al. [Nature, 2021] began exploring identity verification through graph coloring-based relativistic zero-knowledge proofs (RZKPs), a key cryptographic primitive that enables a prover to demonstrate knowledge of secret credentials to a verifier without disclosing any information about the secret. Our work advances this field and addresses unresolved issues: From an engineering perspective, we relax further the relativistic constraints from 60m to 30m, and significantly enhance the stability and scalability of the experimental demonstration of the 2-prover graph coloring-based RZKP protocol for near-term use cases. At the same time, for long-term security against entangled malicious provers, we propose a modified protocol with comparable computation and communication costs, we establish an upper bound on the soundness parameter for this modified protocol. On the other hand, we extend the two-prover, two-verifier setup to a three-prover configuration, demonstrating the security of such relativistic protocols against entangled malicious provers.

arXiv:2507.14324•Jul 18, 2025•1 citation
The Radio Frequency Identification(RFID) grouping-proof protocol is used to verify whether there are multiple tags,because in actual scenario,these tags are used for the identification of one object.However,due to the simple structure and limited computing and storage resources of the RFID tags,the security protocol is difficult to achieve.To address this problem,this paper proposes a grouping-proof protocol that insures privacy and forward security.First,this paper uses hash function and randomization to guarantee the confidentiality and privacy of each session.Then,by means of activate-sleep mechanism,filter-response mechanism and the combination of identity authentication and grouping-proof technology,the efficiency of protocol is improved.Analysis results show that the RFID grouping-proof protocol meets the requirements of anonymity and forward security,so it can prevent eavesdropping,tracking attack,replay attack and de-synchronize attack.
Identity verification is the process of confirming an individual's claimed identity, which is essential in sectors like finance, healthcare, and online services to ensure security and prevent fraud. However, current password/PIN-based identity solutions are susceptible to phishing or skimming attacks, where malicious intermediaries attempt to steal credentials using fake identification portals. Alikhani et al. [Nature, 2021] began exploring identity verification through graph coloring-based relativistic zero-knowledge proofs (RZKPs), a key cryptographic primitive that enables a prover to demonstrate knowledge of secret credentials to a verifier without disclosing any information about the secret. Our work advances this field and addresses unresolved issues: From an engineering perspective, we relax further the relativistic constraints from 60m to 30m, and significantly enhance the stability and scalability of the experimental demonstration of the 2-prover graph coloring-based RZKP protocol for near-term use cases. At the same time, for long-term security against entangled malicious provers, we propose a modified protocol with comparable computation and communication costs, we establish an upper bound on the soundness parameter for this modified protocol. On the other hand, we extend the two-prover, two-verifier setup to a three-prover configuration, demonstrating the security of such relativistic protocols against entangled malicious provers.