Tải bản đầy đủ - 0 (trang)
TÀI LIỆU THAM KHẢO

TÀI LIỆU THAM KHẢO

Tải bản đầy đủ - 0trang

131



[10] Zhang. F and Kim. K, (2003), “Efficient ID-Based Blind Signature and Proxy

Signature from Bilinear Pairings”, PKC 2003,LNCS 2139, pp.31-46, SpringerVerlag.

[11] Shamir. A, (1985), “Identity- Based Cryptosystems and Signature Schemes”

CRYPTO ’84, LNCS 196, pp. 47–53.

[12] Menezes .A.J, Van Oorschot. P.C and Vanstone S.A, (1997), Handbook of

Applied Cryptography, Electrical Engineering and Computer Science

Massachusetts Institute of Technology.

[13] Shafi.G, SilvioO.M. M and Ronald.L.R, (1988) “Against Adaptive ChosenMessage Attacks”, SIAM Journal on Computing Special issue on

cryptography, vol. 17, no. 2, pp. 281–308.

[14] Jinila. B and Komathy, (2015), “Cluster Oriented ID Based Multi- signature

Scheme for Traffic Congestion Warning in Vehicular Ad Hoc Networks”,

Emerging ICT for Bridging the Future - Proceedings of the 49th Annual

Convention of the Computer Society of India CSI Volume 2, pp 337-345.

[15] Biryukov, Nakahara Jr. J , Preneel .B, Vandewalle. J, (2002), “New Weak- Key

Classes



of



IDEA”,



4th



International



Conference



Information



and



Communications Security, ICICS 2002, Lecture Notes in Computer Science

2513, Springer- Verlag, pp. 315- 326, 2002.

[16] Mitchell. C. J, (2001), “An attack on an Định danh multisignature scheme ”

Royal Holloway, University of London, Mathematics Department Technical

Report RHUL- MA, pp 1-4.

[17] Popescu. C, (2011) “A Secure Proxy Signature Scheme with Delegation by

Warrant”, Studies in Informatics and Control, Vol. 20, No. 4, pp 373 - 380.

[18] Lin. C.Y, Wu.C.T, and Hwang. J, (2001), “Định danh structured multisignature

schemes”, Advances in Network and Distributed Systems Security, Kluwer

Academic Publishers, Boston, pp. 45–59.

[19] Gentry.C and Ramzan. Z, (2006), “Identity- Based Aggregate Signatures”, In:

Proceeding of Public Key Cryptography, LNCS 3958, pp. 257–273.



132



[20] Boneh. D and Franklin. M, (2001), “Identity- Based Encryption from the Weil

Pairing”, Advances in Cryptology - 21st Annual International Cryptology

Conference, California, USA, August 19- 23, vol. 2139, pp. 213–229.



[21] Hong. D, Lee. J. K, Kim. D. C, Kwon. D , Ryu .K. H, and G. Lee D, (2014),

“LEA: A 128- Bit Block Cipher for Fast Encryption on Common Processors”,

LNCS 8267, Springer International Publishing Switzerland, pp 1-18.

[22] Bleichenbacher. D, (1996), “Generating ElGamal Signatures Without Knowing

the Secret Key”, EUROCRYPT’96, vol. 1070, pp. 10- 18.

[23] Pointcheval.D, Stern. J, (1996), “Security proofs for signature schemes”,

EUROCRYPT’96, vol. 1070, pp. 387- 398

[24] Daemen, Joan, Rijmen, Vincent, (2003), AES Proposal: Rijndael, National

Institute of Standards and Technology. U.S, p.1

[25] Le . D. P , Bonnecaze .A , and Gabillon. A, (2008), “Multisignatures as Secure

as the Diffie- Hellman Problem in the Plain Public- Key Model”, SCN ’08:

Proceedings of the 6th international conference on Security and Cryptography

for Networks, vol. 15, no. 1, pp. 1–18.

[26] Biham. E, Dunkelman. O, and Keller.N, (2007), "A New Attack on 6- Round

IDEA", Proceedings of Fast Software Encryption, Lecture Notes in Computer

Science, Springer- Verlag, pp 211-224.

[27] Secure Hash Standard, (2002), Federal Information Processing Standards

Publication 180-2 , Institute of Standards and Technology (NIST).

[28] Álvarez . G, Guía. D, Montoya. F, and Peinado. A, (1996), “Akelarre: a new

Block Cipher Algorithm”, Third Annual Workshop on Selected Areas in

Cryptography, SAC 96, Kingston, Ontario, pp1-14.

[29] Delfs. H and Knebl. H, (2007), Introduction to Cryptography Principles and

Applications, 2nd Edition, Springer Berlin Heidelberg New York.

[30] Khali. H and Farah. A, (2007), “DSA and ECDSA- based Multi- Signature



133



Schemes”, IJCSNS International Journal of Computer Science and Network

Security, vol. 7, no. 7.pp 11-19.

[31] Bernstein. D.J and Buchmann. J, (2000), Introduction to Cryptography,

Springer-Verlag Berlin Heidelberg New York.

[32] Yu. J, Kong.F and Li. G, (2010), “Forward- Secure Multisignature, Threshold

Signature and Blind Signature Schemes”, Journal Of Networks, vol. 5, no. 6,

pp. 634–641.

[33] Quirke. J (2004), Security in the GSM system, AusMobile.

[34] Wu. J (2006), Handbook on Theoretical and Algorithmic Aspects of Sensor, Ad

Hoc Wireless and Peer- to- Peer Networks, Auerbach Publications

Talor & Francis Group, New York.

[35] Kawauchi. K, (2005), “On the Security and the Efficiency of Multi- Signature

Schemes Based on a Trapdoor One- Way Permutation” IEICE Transactions

On Fundamentals Of Electronics Communications And Computer Sciences,

vol. 88 , no. 5, pp. 1274–1282.

[36] Cao.J, Li.H, Ma.M ,Li. F, (2018), “Uniform Privacy Preservation Group

Handover Authentication Mechanism for MTC in LTE-A Networks”, Security

and Communication Networks Volume 2018, Article ID 6854612, pp 1-17.

[37] Jeong. K , Lee1. C, Sung . J, Hong.S and Lim.J (2007), “Related- Key

Amplified Boomerang Attacks onthe Full- Round Eagle- 64 and Eagle- 128”,

In Proc. of ACISP 12, Townsville, Australia, Springer- Verlag Berlin

Heidelberg, pp143- 157.

[38] Harn.L and Kiesler. T ,(1989), “New scheme for digital multisignature”

Electron. Lett, vol. 25, no. 15, pp. 1002–1003.

[39] Harn. L, (1999), “Digital multisignature with distinguished signing

authorities”, Electron. Lett, vol. 35, no. 4, pp. 294–295,28

[40] Harn. L, (1994), “Group oriented (t- n) threshold digital signature scheme and

digital multisignature”, IEE Proc. - Comput.Digit. Tech., vol. 141, no. 5, pp.



134



307–313.

[41] Harn.L, (1994), “New digital signature scheme based on discrete Logarit”

Electronics Letters, vol. 30, no. 5, pp. 396–398.

[42] Bellare. M and Neven. G,(2006), “Multi- Signatures in the Plain Public- Key

Model and a General Forking Lemma”, CCS’06, October 30–November 3,

2006, Alexandria, Virginia, USA, pp 1-10.

[43] Das. M. L, Saxena. A, and Phatak. D. B (2018), “Algorithms and Approaches

of Proxy Signature: A Survey”, Dhirubhai Ambani Institute of Information

and Communication Technology Gandhinagar, India, pp 1-29.

[44] Meziani. M and Cayrel P.L, (2010), “A Multi- Signature Scheme based on

Coding Theory”, World Academy of Science, Engineering and Technology,

vol. 63, pp. 405-411.

[45] Minh.N.H and Dung.L.H,(2010),“ New Digital Multisignature Scheme with

Distinguished Signing Responsibilities”, Information Technology And

Control, vol.10, pp 51-57.

[46] Martinel. N and Foresti. G. L , (2012), “Multi- Signature based Person ReIdentification”, Electronics Letters, vol. 48, no. 13, pp. 765–767.

[47] Sunitha . N. R , Amberker. B. B, and Koulgi. P, (2008), “Transferable echeques using Forward- Secure Multi- signature Scheme”, Proceedings of the

World Congress on Engineering and Computer Science, San Francisco, USA,

October 22- 24.

[48] NIST, (2013), Digital Signature Standard (DSS) FIPS 186- 4,



National



Institute of Standards and Technology.

[49] Shor . P. W,(1997), “Polynomial- Time Algorithms for Prime Factorization and

Discrete Logarits on a Quantum Computer”, Proceedings of the 35th Annual

Symposium on Foundations of Computer Science, IEEE, pp. 1-28.

[50] Wang.F, Chen.C.C, Lin.C and Chang.S (2016), “Secure and Efficient Identitybased Proxy Multi-signature Using Cubic Residues”, International Journal of

Network Security, Vol.18, No.1, pp.90-98.



135



[51] Sahu. R .A and Padhye. S, (2014), “An ID-Based Multi-Proxy Multi-Signature

Scheme”, Int’l Conf. on Computer & Communication Technolog (ICCCT10),

pp. 60-63.

[52] Tiwari.N and Padhye. S, (2015), “Provable Secure Multi-Proxy Signature

Scheme without Bilinear Maps”, International Journal of Network Security,

Vol.17, No.6, PP.736-742.

[53] Sahu. R. A and Padhye. S, (2010), “An Định danh Multi- Proxy MultiSignature Scheme”, Int’l Conf. on Computer & Communication Technology,

pp. 60–63.

[54] Dutta. R , Barua. R, Sarkar. P, and Road. B. T, (2004), Pairing- Based

Cryptographic Protocols : A Survey,



Introduction Preliminaries Key



Agreement Schemes Conclusion IACR Eprint archive.

[55] Rivest. R. L, (1994), “The RC5 Encryption Algorithm”, Proceedings of the

Second International Worksh op on Fast Software Encryption, pp. 86- 96.

[56] Ostrovsky. R , (2010), Foundations of Cryptography, CS 282A/MATH 209A,

University of California, Los Angeles.

[57] Rivest. R , Shamir. A, and Adleman. L , (1998), “A Method for Obtaining

Digital Signatures and Public- Key Cryptosystems”, Commun. ACM, vol. 21,

pp. 120–126

[58] Kumar. R, Mishra. K. K, Tripathi. A, Toma. A, Singh. S, (2014),“Modified

Symmetric Encryption Algorithm”, Motilal Nehru National Institute of

Technology Allahabad Allahabad, India, pp 1-14.

[59] Goldwasser. S, Micali. S, and Rivest. R. L, (1988), “A Digital Signature

Scheme Secure Against Adaptive Chosen- Message Attacks”, SIAM Journal

on Computing Special issue on cryptography, vol. 17, no. 2, pp. 281–308.

[60] Aboud. S. J and Fayoumi. M. A, (2007), “A New Multisignature Scheme Using

Re- Encryption Technique”, Journal of Applied Sciences, vol. 7, no. 13, pp.

1813–1817.

[61] Micali. S, Ohta. K, and Reyzin.L, (2001) “Accountable- Subgroup



136



Multisignatures”, ACM Conference on Computer and Communications

Security, pp 1-18.

[62] Hwang S-J, Hwang. M-S, and Tzeng S-F, (2003), “A New Digital

Multisignature Scheme With Distinguished Signing Authorities”, Journal of

Information Scienceand Engineering, vol. 19, pp. 881–887.

[63] Shieh.S-P, Lin.C-T, Yang.W-B, and Sun. H-M, (2000), “Digital Multisignature

Schemes for Authenticating Delegates in Mobile Code Systems”, IEEE

Transactions On Vehicular Technology, vol. 49, no. 4.pp 1464 – 1473.

[64] Elgamal. T, (1985), “A public- key cryptosystem and a signature scheme based

on discrete Logarit”, IEEE Trans. Inform. Theory, vol. 31, pp. 469–472.

[65] Diffie.W and Hellman. M, (1976), “New directions in cryptography”, IEEE

Transaction on Information Theory, pp. 644–654.

[66] Lai. X and Massey. J, (1991), “A Proposal for a New Block Encryption

Standard”, Advance in Cryptography, EUROCRYPT 90, Springer Verlag,

Berlin, pp. 389- 404.

[67] Li. X and Chen. K, (2005), “Định danh multi- proxy signature, proxy multisignature and multi- proxy multi- signature schemes from bilinear pairings”

Applied Mathematics and Computation, vol. 169, no. 1, pp. 437–450.

[68] Lindell. Y, (2010), Foundations of Cryptography, Bar- Ilan University.

[69] Canarda.S, Phan.D.H , Pointcheval.D, Trinh.V.C, (2018), “A New Technique

for Compacting Ciphertext in Multi-Channel Broadcast Encryption and

Attribute-Based Encryption”, Theoretical Computer Science, Volume 723, pp

51-72.

[70] Shao. Z, (2010), “Multisignature Scheme Based on Discrete Logarit in the

Plain Public Key Model” , Informatice, vol. 34, pp. 509–515.

[71] Stallings. W, (2005), Cryptography and Network Security Principles and

Practices, Prentice Hall.

[72] Canavan. J. E, (2000), Fundamentals of Network Security, Artech house, INC.

[73] Arora. S and Barak. B, (2007), Computational Complexity ModernApproach,



137



Cambridge University Press.

[74] Ynliang Zheng, (1997), “Digital signcryption or how to achievecost(Signature

&: Encryption) << cost(signature) + cost(encryption)”,



Lecture Notes in



Computer Science (including subseries Lecture Notes in Artificial Intelligence

and Lecture Notes in Bioinformatics), 1294,165–179.

[75] Lawrence.C.W, (2008), Elliptic Curves Number Theory and Cryptography,

Second Edition, CRC Press, Chapman & Hall / CRC Taylor & Francis Group

6000 Broken Sound Parkway NW, Suite 300 Boca Raton, FL 33487-2742

[76] Tahat.N, Abdallah.E, (2014), “A new signing Algorithm Based on Elliptic

Curve Discrete Logarithms and Quadratic Residue Problems”, Italian journal

of pure and applied mathematics – n. 32−2014,pp 125-132.



Tài liệu bạn tìm kiếm đã sẵn sàng tải về

TÀI LIỆU THAM KHẢO

Tải bản đầy đủ ngay(0 tr)

×