scholarly journals A Fuzzy Identity-Based Signature Scheme from Lattices in the Standard Model

2014 ◽  
Vol 2014 ◽  
pp. 1-10 ◽  
Author(s):  
Chunli Yang ◽  
Shihui Zheng ◽  
Licheng Wang ◽  
Miaomiao Tian ◽  
Lize Gu ◽  
...  
Keyword(s):  
Standard Model ◽  
Secret Key ◽  
Random Oracles ◽  
Sharing Scheme ◽  
The Standard Model ◽  
Identity Based ◽  
Shamir Secret Sharing Scheme ◽  
Fuzzy Identity ◽  
Shamir Secret Sharing ◽  
Strong Unforgeability

A fuzzy identity-based signature (FIBS) scheme allows a user with identityIDto issue a signature that could be verified with identityID'if and only ifIDandID'lie within a certain distance. To obtain an FIBS scheme that can resist known quantum attacks, we use the double-trapdoor technique from ABB10a for secret key extracting and the vanishing trapdoor technique from Boyen10 for message signing. In addition, in order to reflect the functionality of fuzziness, Shamir secret sharing scheme is also used in our construction. In this paper, we propose an FIBS scheme from lattices and prove that this new scheme achieves strong unforgeability under selective chosen-identity and adaptive chosen-message attacks (SU-sID-CMA) in the standard model. To the best of our knowledge, our scheme is not only the first FIBS scheme from lattices without random oracles but also the first FIBS scheme that achieves strong unforgeability.

scholarly journals New Fuzzy Identity-Based Encryption in the Standard Model

Informatica ◽  
2010 ◽  
Vol 21 (3) ◽  
pp. 393-407 ◽  
Author(s):  
Yanli Ren ◽  
Dawu Gu ◽  
Shuozhong Wang ◽  
Xinpeng Zhang
Keyword(s):  
Standard Model ◽  
Identity Based Encryption ◽  
The Standard Model ◽  
Identity Based ◽  
Fuzzy Identity

New Constructions of Hierarchical Identity-Based Signature in the Standard Model

2011 ◽  
Vol 474-476 ◽  
pp. 1356-1361
Author(s):  
Qing Wu ◽  
Su Xia Sun
Keyword(s):  
Standard Model ◽  
Provable Security ◽  
Security Model ◽  
Private Key ◽  
Random Oracles ◽  
Diffie Hellman ◽  
The Standard Model ◽  
Cdh Assumption ◽  
Identity Based ◽  
Provably Secure

In this paper, a new construct of hierarchical identity-based signature(HIBS) scheme is proposed at first. It has many advantages over those available, such as fully secure without using random oracles, efficient signing algorithm. Additionally, it is provably secure under the computational Diffie-Hellman(CDH) assumption. This assumption is more natural than many of the hardness assumptions recently introduced to HIBS in the standard model. However, the length of its private key and signature increases as the hierarchy depth expands. Then a modified scheme is presented. The signature of modified scheme consists of three group elements and the private keys size shrinks as the identity depth increases. Under the h-CDH assumption, it is provable security in full security model without using random oracles.

scholarly journals Cryptanalysis of a Fuzzy Identity Based Encryption Scheme in the Standard Model

Informatica ◽  
2012 ◽  
Vol 23 (2) ◽  
pp. 299-314
Author(s):  
Xu An Wang ◽  
Xiaoyuan Yang ◽  
Minqing Zhang ◽  
Yong Yu
Keyword(s):  
Standard Model ◽  
Encryption Scheme ◽  
Identity Based Encryption ◽  
The Standard Model ◽  
Identity Based ◽  
Fuzzy Identity

Novel Identity-Based Hash Proof System with Compact Master Public Key from Lattices in the Standard Model

2019 ◽  
Vol 30 (04) ◽  
pp. 589-606
Author(s):  
Qiqi Lai ◽  
Bo Yang ◽  
Zhe Xia ◽  
Yannan Li ◽  
Yuan Chen ◽  
...  
Keyword(s):  
Standard Model ◽  
Random Oracle Model ◽  
Random Oracle ◽  
Public Key ◽  
Proof System ◽  
Secret Key ◽  
Random Lattice ◽  
The Standard Model ◽  
Identity Based ◽  
Hash Proof System

As the progress of quantum computers, it is desired to propose many more efficient cryptographic constructions with post-quantum security. In the literatures, almost all cryptographic schemes and protocols can be explained and constructed modularly from certain cryptographic primitives, among which an Identity-Based Hash Proof System (IB-HPS) is one of the most basic and important primitives. Therefore, we can utilize IB-HPSs with post-quantum security to present several types of post-quantum secure schemes and protocols. Up until now, all known IB-HPSs with post-quantum security are instantiated based on latticed-based assumptions. However, all these lattice-based IB-HPSs are either in the random oracle model or not efficient enough in the standard model. Hence, it should be of great significance to construct more efficient IB-HPSs from lattices in the standard model. In this paper, we propose a new smooth IB-HPS with anonymity based on the Learning with Errors (LWE) assumption in the standard model. This new construction is mainly inspired by a classical identity-based encryption scheme based on LWE due to Agreawal et al. in Eurocrypt 2010. And our innovation is to employ the algorithm SampleGaussian introduced by Gentry et al. and the property of random lattice to simulate the identity secret key with respect to the challenge identity. Compared with other existing IB-HPSs in the standard model, our master public key is quite compact. As a result, our construction has much lower overheads on computation and storage.

scholarly journals Strongly Unforgeable Certificateless Signature Resisting Attacks from Malicious-But-Passive KGC

2017 ◽  
Vol 2017 ◽  
pp. 1-8 ◽  
Author(s):  
Wenjie Yang ◽  
Jian Weng ◽  
Weiqi Luo ◽  
Anjia Yang
Keyword(s):  
Standard Model ◽  
Digital Signature ◽  
Theory And Practice ◽  
Key Generation ◽  
Random Oracles ◽  
The Standard Model ◽  
Certificateless Signature ◽  
Adversarial Model ◽  
Strong Unforgeability

In digital signature, strong unforgeability requires that an attacker cannot forge a new signature on any previously signed/new messages, which is attractive in both theory and practice. Recently, a strongly unforgeable certificateless signature (CLS) scheme without random oracles was presented. In this paper, we firstly show that the scheme fails to achieve strong unforgeability by forging a new signature on a previously signed message under its adversarial model. Then, we point out that the scheme is also vulnerable to the malicious-but-passive key generation center (MKGC) attacks. Finally, we propose an improved strongly unforgeable CLS scheme in the standard model. The improved scheme not only meets the requirement of strong unforgeability but also withstands the MKGC attacks. To the best of our knowledge, we are the first to prove a CLS scheme to be strongly unforgeable against the MKGC attacks without using random oracles.

scholarly journals Strong Designated Verifier Signature Scheme with Undeniability and Strong Unforgeability in the Standard Model

2019 ◽  
Vol 9 (10) ◽  
pp. 2062
Author(s):  
Xiaodong Yang ◽  
Guilan Chen ◽  
Ting Li ◽  
Rui Liu ◽  
Meiding Wang ◽  
...  
Keyword(s):  
Standard Model ◽  
Signature Scheme ◽  
Signature Schemes ◽  
Private Key ◽  
Random Oracles ◽  
Computational Overhead ◽  
The Standard Model ◽  
Designated Verifier ◽  
Designated Verifier Signature ◽  
Strong Unforgeability

Strong designated verifier signature can provide an efficient way to protect the identity privacy of the signer and the integrity of the data transmitted over the public channel. These characteristics make it very useful in outsourcing computing, electronic voting, electronic bidding, electronic auction and other fields. However, most strong designated verifier signature schemes are unable to identify the real signature generator when the signer and the designated verifier dispute a signature. In addition, the existing strong designated verifier signature schemes in the standard model rarely satisfy strong unforgeability, and thus cannot prevent the attacker from forging a valid signature on any previously signed message. Therefore, designing a strong designated verifier signature scheme without random oracles that satisfies strong unforgeability and undeniability is very attractive in both practice and theory. Motivated by these concerns, we design the first undeniable strong designated verifier signature scheme without random oracles, in which the arbiter can independently perform the judgment procedure to prove whether a controversial signature is generated by the signer or the designated verifier. Under standard assumptions, the scheme is proved to be strongly unforgeable in standard model. Furthermore, it not only achieves non-transferability and privacy of the signer’s identity but also satisfies the undeniable property of traditional digital signature schemes. Performance analysis results show that the length of the signer’s private key, the designated verifier’s private key and signature length are 40 bits, 40 bits and 384 bits, respectively. Compared with he related schemes, the proposed scheme has higher performance in signature length, private key size and computational overhead. Finally, we show how to apply it to implement outsourcing computation in cloud computing.

scholarly journals On-line/Off-line Identity-based Signature Scheme with Strong Unforgeability in the Standard Model

2019 ◽  
Vol 1302 ◽  
pp. 022015
Author(s):  
Xiaodong Yang ◽  
Chunlin Chen ◽  
Tingchun Ma ◽  
Yutong Li ◽  
Likun Xiao
Keyword(s):  
Standard Model ◽  
Signature Scheme ◽  
The Standard Model ◽  
On Line ◽  
Identity Based ◽  
Strong Unforgeability

scholarly journals Revocable and strongly unforgeable identity-based signature scheme in the standard model

2016 ◽  
Vol 9 (14) ◽  
pp. 2422-2433 ◽  
Author(s):  
Zhenhua Liu ◽  
Xiangsong Zhang ◽  
Yupu Hu ◽  
Tsuyoshi Takagi
Keyword(s):  
Standard Model ◽  
Signature Scheme ◽  
The Standard Model ◽  
Identity Based

Insecurity of an Efficient Identity-Based Proxy Signature in the Standard Model

2014 ◽  
Vol 58 (10) ◽  
pp. 2507-2508 ◽  
Author(s):  
Debiao He ◽  
Mingwu Zhang ◽  
Baowen Xu
Keyword(s):  
Standard Model ◽  
Proxy Signature ◽  
The Standard Model ◽  
Identity Based
Sign in / Sign up

Export Citation Format

Share Document