Identity‐based multi‐proxy multi‐signature scheme provably secure in random oracle model

Sahu, Rajeev Anand; Padhye, Sahadeo

doi:10.1002/ett.2667

Cited by 8 publications

(8 citation statements)

References 32 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…s is a secret key and p is the corresponding public key. A number of signature schemes are proposed in the literature. A public‐key digital signature scheme S is said to be strongly unforgeable if the probability that any adversary, after intercepting any number of signatures for adaptively selected messages of his choice, can produce a new signature is negligible.…”

Section: Preliminariesmentioning

confidence: 99%

Design of lattice‐based ElGamal encryption and signature schemes using SIS problem

Gupta

2017

Trans Emerging Tel Tech

View full text Add to dashboard Cite

The emerging technologies like quantum computing and cloud computing have a complex computing power and can break the security of the classical cryptographic constructions (like ElGamal's cryptosystem). Thus, we were motivated to work on hard lattice problems, which are more complex and can resist these new modern technologies. In this proposal, we present a lattice‐based version of discrete logarithm problem‐based ElGamal public‐key encryption and signature schemes that exhibit strong security features and efficient implementation. The security of these presented schemes is based on the worst‐case hardness of approximating a small integer vector in their corresponding lattice. Furthermore, this proposed work illustrates a security proof of the proposed schemes and shows that the presented schemes are well protected in the modern computing environment. The performance analysis and comparison with classical ElGamal schemes and recent lattice‐based schemes are also made, and it is seen that the proposed schemes achieve better performance.

show abstract

Section: Preliminariesmentioning

confidence: 99%

Design of lattice‐based ElGamal encryption and signature schemes using SIS problem

Gupta

2017

Trans Emerging Tel Tech

View full text Add to dashboard Cite

show abstract

“…Since the notion of proxy signatures has been introduced, several variants of proxy signatures have been proposed. These include proxy signature schemes [9][10][11][12][13][14][15][16][17], identity-based proxy signature schemes based on the bilinear pairings [18][19][20][21][22][23][24][25], designated verifier signature schemes [26][27][28], (identity-based) multi-proxy signatures [23,[29][30][31][32][33], identity-based proxy multi-signatures [30,[34][35][36][37], (identity-based) multi-proxy multi-signature schemes [30,[38][39][40][41][42][43], identity-based proxy signatures with message recovery [44,45], a certificate-less proxy signature with message recovery and its security analysis [46,47] and analysis of proxy signatures [48][49][50]. In this study, we focus on identity-based proxy signature schemes with message recovery property to shorten i...…”

Section: Introductionmentioning

confidence: 99%

A short ID‐based proxy signature scheme

Asaar

Salmasizadeh

Susilo

2014

Int J Communication

View full text Add to dashboard Cite

Abstract. The notion of identity-based proxy signature with message recovery feature has been proposed to shorten identity-based proxy signatures and improve their communication overhead since signed messages are not transmitted with these kinds of signatures. There are a few schemes for this notion: Singh and Verma's scheme and Yoon et al.'s scheme. Unfortunately, Tian et al. by presenting two forgery attacks show that Singh and Verma's scheme is not secure, and also Yoon et al.'s scheme does not support provable security. The contributions of this paper are twofold. First, we review Yoon et al.'s scheme and discuss why it does not have message recovery property, and consequently it is not short. Second, we propose a short identity-based proxy signature scheme with the help of message recovery property, and show that it is secure under CDH assumption in the random oracle model. Furthermore, our scheme is more efficient than (as efficient as) previous identity-based proxy signatures.Keywords: identity-based signature, identity-based signature with message recovery, identity-based proxy signature, CDH assumption, random oracle model.

show abstract

“…Instead of using passwords or keys, security that has drawn great attention of researchers , can be provided in the physical layer where signal processing techniques can be used to degrade an eavesdropper's channel so that meaningful detection at the eavesdropper is difficult or even impossible. Later in , the author studied a more general wiretap channel model and showed that secure communication is in fact possible without using key encryption in the presence of the eavesdropper.…”

Section: Introductionmentioning

confidence: 99%

A robust and distributed design for coordinated downlink beamforming for secure MISO interference channels

Fei

Wang

et al. 2014

Trans Emerging Tel Tech

View full text Add to dashboard Cite

In this paper, we address the optimization problems of downlink coordinated beamforming over the K‐user multiple‐input single‐output interference channel with confidential messages. Our design objective is to minimise the total transmit power subject to the constraints of individual signal‐to‐interference plus noise ratio and equivocation rates. For the case with perfect channel state information (CSI), by deriving the equivalent forms for the signal‐to‐interference plus noise ratio and the secrecy constraints, the optimization problem is reformulated as a second‐order cone programme problem. Then, an optimal distributed algorithm using the partial Lagrangian duality is discussed. In addition we extend the analysis to the imperfect CSI scenario with bounded ellipsoidal errors, the centralised algorithm has been proposed by solving a semi‐definite programme with the help of rank relaxation, whereas the distributed robust algorithm is devised by using ADMM. Finally, the simulation results have shown that with perfect CSI, the centralised and distributed algorithms have nearly the same performance, but in the case of imperfect CSI, the centralised algorithm shows a slightly better performance. Copyright © 2014 John Wiley & Sons, Ltd.

show abstract

Identity‐based multi‐proxy multi‐signature scheme provably secure in random oracle model

Cited by 8 publications

References 32 publications

Design of lattice‐based ElGamal encryption and signature schemes using SIS problem

Design of lattice‐based ElGamal encryption and signature schemes using SIS problem

A short ID‐based proxy signature scheme

A robust and distributed design for coordinated downlink beamforming for secure MISO interference channels

Contact Info

Product

Resources

About