DocumentCode :
3216120
Title :
Group-oriented signature schemes based on Chinese remainder theorem
Author :
Porkodi, C. ; Arumuganathan, R.
Author_Institution :
Dept. of Math. & Comput. Applic., PSG Coll. of Technol., Coimbatore, India
fYear :
2009
fDate :
9-11 Dec. 2009
Firstpage :
1661
Lastpage :
1664
Abstract :
In this paper two group signature schemes are developed using the Chinese remainder theorem, the first work is based on exponentiation of primitive root of a prime field and the second work is based on elliptic curves. A trusted authority is involved in the schemes for the construction of the group key and individual participant keys. The constructed keys are used as long run keys. The group signature generated by the trusted authority from the partial signatures of the participants. The security of the proposed schemes depends on the NP-hard problems integer factorization, discrete logarithm and elliptic curve discrete logarithm. The signature schemes are illustrated using Mathematica 6.0 and MATLAB 7.0.
Keywords :
computational complexity; digital signatures; public key cryptography; Chinese remainder theorem; MATLAB 7.0; Mathematica 6.0; NP-hard problems integer factorization; elliptic curve discrete logarithm; group-oriented signature schemes; trusted authority; Authentication; Computer applications; Computer security; Data security; Educational institutions; Elliptic curve cryptography; Elliptic curves; MATLAB; Mathematics; NP-hard problem; Chinese remainder theorem; Group signatures; discrete logarithm problem; elliptic curve discrete logarithm problem; integer factorization problem; primitive root;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Nature & Biologically Inspired Computing, 2009. NaBIC 2009. World Congress on
Conference_Location :
Coimbatore
Print_ISBN :
978-1-4244-5053-4
Type :
conf
DOI :
10.1109/NABIC.2009.5393640
Filename :
5393640
Link To Document :
بازگشت