scholarly journals An efficient conditionally anonymous ring signature in the random oracle model

2012 ◽  
Vol 461 ◽  
pp. 106-114 ◽  
Author(s):  
Shengke Zeng ◽  
Shaoquan Jiang ◽  
Zhiguang Qin
Keyword(s):  
Random Oracle Model ◽  
Random Oracle ◽  
Ring Signature

Certificate-Based Generalized Ring Signcryption Scheme

2018 ◽  
Vol 29 (06) ◽  
pp. 1063-1088 ◽  
Author(s):  
Caixue Zhou ◽  
Guangyong Gao ◽  
Zongmin Cui ◽  
Zhiqiang Zhao
Keyword(s):  
Random Oracle Model ◽  
Bilinear Pairings ◽  
Random Oracle ◽  
Formal Definition ◽  
Security Model ◽  
Storage Space ◽  
Ring Signature ◽  
Highly Efficient ◽  
Signcryption Scheme

Generalized ring signcryption (GRSC) can realize ring signature and ring signcryption functions with only one key pair and one algorithm. It is very useful for a system with a large number of users, or whose function may be changed, or with limited storage space. We give a formal definition and security model of GRSC in the certificate-based cryptosystem setting and propose a concrete scheme by using bilinear pairings. The confidentiality of our scheme can be proved under the GBDH and CDH assumptions and the unforgeability of our scheme can be proved under [Formula: see text] and CDH assumptions in the random oracle model, and what is more, our scheme has unconditional anonymity. Compared with other certificateless ring signcryption schemes that use bilinear pairings, it is a highly efficient one.

scholarly journals A Certificateless Ring Signature Scheme with High Efficiency in the Random Oracle Model

2017 ◽  
Vol 2017 ◽  
pp. 1-9 ◽  
Author(s):  
Yingying Zhang ◽  
Jiwen Zeng ◽  
Wei Li ◽  
Huilin Zhu
Keyword(s):  
Digital Signature ◽  
High Efficiency ◽  
Random Oracle Model ◽  
Public Key Cryptography ◽  
Random Oracle ◽  
Bilinear Pairing ◽  
Public Key ◽  
Ring Signature ◽  
Certificateless Public Key Cryptography ◽  
Identity Based

Ring signature is a kind of digital signature which can protect the identity of the signer. Certificateless public key cryptography not only overcomes key escrow problem but also does not lose some advantages of identity-based cryptography. Certificateless ring signature integrates ring signature with certificateless public key cryptography. In this paper, we propose an efficient certificateless ring signature; it has only three bilinear pairing operations in the verify algorithm. The scheme is proved to be unforgeable in the random oracle model.

scholarly journals Lattice-Based Logarithmic-Size Non-Interactive Deniable Ring Signatures

Entropy ◽  
2021 ◽  
Vol 23 (8) ◽  
pp. 980
Author(s):  
Huiwen Jia ◽  
Chunming Tang ◽  
Yanhua Zhang
Keyword(s):  
Random Oracle Model ◽  
Random Oracle ◽  
Group Signature ◽  
Small Integer ◽  
Knowledge Argument ◽  
Attractive Feature ◽  
Ring Signature ◽  
Ring Signatures ◽  
Efficient Scheme ◽  
High Level

Deniable ring signature can be regarded as group signature without group manager, in which a singer is capable of singing a message anonymously, but, if necessary, each ring member is allowed to confirm or disavowal its involvement in the signature via an interactive mechanism between the ring member and the verifier. This attractive feature makes the deniable ring signature find many applications in the real world. In this work, we propose an efficient scheme with signature size logarithmic to the cardinality of the ring. From a high level, we adapt Libert et al.’s zero-knowledge argument system (Eurocrypt 2016) to allow the prover to convince the verifier that its witness satisfies an additional condition. Then, using the Fait-Shamir transformation, we get a non-interactive deniable ring signature scheme that satisfies the anonymity, traceability, and non-frameability under the small integer solution assumption in the random oracle model.

scholarly journals Identity-Based Linkable Ring Signature on NTRU Lattice

2021 ◽  
Vol 2021 ◽  
pp. 1-17
Author(s):  
Yongli Tang ◽  
Feifei Xia ◽  
Qing Ye ◽  
Mengyao Wang ◽  
Ruijie Mu ◽  
...  
Keyword(s):  
Random Oracle Model ◽  
Random Oracle ◽  
Small Integer ◽  
Rejection Sampling ◽  
Signature Schemes ◽  
Ring Signature ◽  
Storage Overhead ◽  
Signature Generation ◽  
Identity Based ◽  
And Storage

Although most existing linkable ring signature schemes on lattice can effectively resist quantum attacks, they still have the disadvantages of excessive time and storage overhead. This paper constructs an identity-based linkable ring signature (LRS) scheme over NTRU lattice by employing the technologies of trapdoor generation and rejection sampling. The security of this scheme relies on the small integer solution (SIS) problem on NTRU lattice. We prove that this scheme has unconditional anonymity, unforgeability, and linkability under the random oracle model (ROM). Through the performance analysis, this scheme has a shorter size of public/private keys, and when the number of ring members is small (such as N ≤ 8 ), this scheme has a shorter signature size compared with other existing latest lattice-based LRS schemes. The computational efficiency of signature has also been further improved since it only involves multiplication in the polynomial ring and modular operations of small integers. Finally, we implemented our scheme and other similar schemes, and it is shown that the time for the signature generation and verification of this scheme decreases roughly by 44.951% and 33.503%, respectively.

scholarly journals Linkable Ring Signature Scheme Using Biometric Cryptosystem and NIZK and Its Application

2021 ◽  
Vol 2021 ◽  
pp. 1-14
Author(s):  
Xuechun Mao ◽  
Lin You ◽  
Chengtang Cao ◽  
Gengran Hu ◽  
Liqin Hu
Keyword(s):  
Random Oracle Model ◽  
Random Oracle ◽  
Identity Authentication ◽  
Signature Scheme ◽  
Secret Key ◽  
Ring Signature ◽  
Transaction Model ◽  
Security Proof ◽  
Biometric Encryption ◽  
Biometric Cryptosystem

Biometric encryption, especially based on fingerprint, plays an important role in privacy protection and identity authentication. In this paper, we construct a privacy-preserving linkable ring signature scheme. In our scheme, we utilize a fuzzy symmetric encryption scheme called symmetric keyring encryption (SKE) to hide the secret key and use non-interactive zero-knowledge (NIZK) protocol to ensure that we do not leak any information about the message. Unlike the blind signature, we use NIZK protocol to cancel the interaction between the signer (the prover) and the verifier. The security proof shows that our scheme is secure under the random oracle model. Finally, we implement it on a personal computer and analyze the performance of the constructed scheme in practical terms. Based on the constructed scheme and demo, we give an anonymous cryptocurrency transaction model as well as mobile demonstration.

scholarly journals A Lightweight Certificateless Aggregate Ring Signature Scheme for Privacy-preserving in Smart Grids

2021 ◽  
Author(s):  
Huiwen Wang ◽  
Liangliang Wang ◽  
Mi Wen ◽  
Kefei Chen ◽  
Yiyuan Luo
Keyword(s):  
Smart Grids ◽  
Computational Cost ◽  
Random Oracle Model ◽  
Random Oracle ◽  
Privacy Preserving ◽  
Type I ◽  
User Privacy ◽  
Ring Signature ◽  
Aggregate Signature ◽  
Diffie Hellman

Abstract There exists a problem of user privacy leakage in the smart grids (SGs) that malicious attackers may intercept or tamper with electricity data and associate the stolen data with real users to commit crimes. Besides, node equipment resources in the SGs are limited. Aiming at the problems above, most of the existing privacy-preserving schemes apply aggregate signature to ensure the integrity of message and improve communication efficiency. However, they cannot realize the anonymity of users to block link attacks, and most of the aggregate signature verification has a high computational cost. Therefore, we propose a certificateless aggregate ring signature (CLARS) scheme based on computational Diffie-Hellman problem and decisional Diffie-Hellman problem. Our scheme is suitable for privacy-preserving in SGs. In this scheme, certificateless cryptosystem is used to avoid key escrow and certificates management problems and ring signature is used to ensure the unconditional anonymity of users. In addition, our scheme is proved to be unforgeability and unconditional anonymity under adaptively chosen message attacks against Type I and Type II adversaries in the random oracle model. Compared with previous certificateless aggregate signature (CLAS) schemes, our CLARS scheme has lower computational cost, which only needs two pairing operations.

scholarly journals Fuzzy Identity-Based Ring Signature from Lattices

2021 ◽  
Vol 2021 ◽  
pp. 1-9
Author(s):  
Chengtang Cao ◽  
Lin You ◽  
Gengran Hu
Keyword(s):  
Large Scale ◽  
Quantum Computer ◽  
Random Oracle Model ◽  
Random Oracle ◽  
Small Integer ◽  
Ring Signature ◽  
Computer Attacks ◽  
Identity Based ◽  
The One ◽  
Fuzzy Identity

In this paper, a construction of a fuzzy identity-based ring signature scheme (LFIBRS) is proposed. Our LFIBRS combines the characteristics of both the fuzzy identity-based signature (FIBS) and the ring signature. On the one hand, a signature issued under an identity ID can be verified by any identity ID ′ that is “close enough” to the identity ID . Since biometric identification is the well-known most popular and reliable identification method, our LFIBRS can be applied in such a situation whenever it is required for official audit or supervision that the signer’s real identity is needed to be authenticated. On the other hand, LFIBRS provides anonymity under the random oracle model. In addition, LFIBRS provides unforgeability under the small integer solution (SIS) lattice hardness assumption which can resist large-scale quantum computer attacks in the future.

scholarly journals An Identity-Based Blind Signature Scheme Using Lattice with Provable Security

2020 ◽  
Vol 2020 ◽  
pp. 1-12
Author(s):  
Quanrun Li ◽  
Chingfang Hsu ◽  
Debiao He ◽  
Kim-Kwang Raymond Choo ◽  
Peng Gong
Keyword(s):  
Quantum Computer ◽  
Rapid Development ◽  
Random Oracle Model ◽  
Random Oracle ◽  
Mean Value ◽  
Blind Signature ◽  
Signature Scheme ◽  
Practical Applications ◽  
Universal Quantum ◽  
Identity Based

With the rapid development of quantum computing and quantum information technology, the universal quantum computer will emerge in the near decades with a very high probability and it could break most of the current public key cryptosystems totally. Due to the ability of withstanding the universal quantum computer’s attack, the lattice-based cryptosystems have received lots of attention from both industry and academia. In this paper, we propose an identity-based blind signature scheme using lattice. We also prove that the proposed scheme is provably secure in the random oracle model. The performance analysis shows that the proposed scheme has less mean value of sampling times and smaller signature size than previous schemes. Thus, the proposed scheme is more suitable for practical applications.

Sign in / Sign up

Export Citation Format

Share Document