Please use this identifier to cite or link to this item:
Generic Construction on Equality Test Based on Homomorphic Encryptions
|Issue Date: ||2019-02-12 16:00:16 (UTC+8)|
Two-party equality testing protocol allows two entities to compare their secrete information without leaking any information except the comparison result. In previous works the comparison result can only be obtained by one entity (ie. informer) and then the entity informs the result to the other entity ( ie. receiver). The receiver has to accept the received result since he has no way to verify its correctness. Although some scholars have proposed some proposal mechanisms that can be verified by both parties, Those protocols may be difficult to implement due to limitations of the encryption algorithm, or the contract flexibility may be low due to the necessity of using the specified encryption algorithm. Therefore, in this thesis,we propose a new two-party equality testing protocol. Our protocol has the same function of mutual equality verification, but has lower restrictions on the encryption algorithm and is applicable to almost all Addition homomorphic encryption algorithm or multiplicative homomorphic encryption algorithm. It is also more efficient in implementation and operation. After the agreement is proposed, the security and correctness of the protocol are proved by theory, and the related applications of the protocol are proposed. Finally, the time complexity of the protocol is analyzed and its performance is discussed.
|Reference: || Andrew C. Yao, "Protocols for Secure Computations", Proceedings of 21stAnnual IEEE Symposium on Foundations of Computer Science, 1982.|
T. ElGamal, “ A public key cryptosystem and a signature scheme based on discrete logarithms”, IEEE Trans. Inform. Theory, vol. 31, pp. 469-472, 1985.
 Pascal Paillier, “Public-Key Cryptosystems Based on Composite Degree Residuosity Classes”, Proceedings of Advances in Cryptology (Eurocrypt’99), LNCS vol. 1592, pp.l 223-238, 1999.
C.Gentry, "Fully homomorphic encryption using ideal lattices", Proceedings of STOC ‘09, ACM, pages 169-178, 2009.
 S. Goldwasser and S. Micali, "Probabilistic encryption & how to play mental poker keeping secret all partial information", Proceedings of Annual ACM Symposium on Theory of Computing, pp.365-377, 1982.
 R. Li and C.K. Wu, "Co-operatice private equality test", International Journal of Network Security, vol.1 No.3, PP.149-153, 2005.
 Cheng-Feng Wu, "A Study on the Design of Two-Party Equality Testing Protocol and Its Applications"
 P. W. Shor, “Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer”, SIAM Journal on Computing, Vol. 26, No. 5, pp. 1484-1509, 1997
 Peter Mell and Tim Grance, “The NIST Definition of Cloud Computing”
 J. Benaloh, “Dense Probabilistic encryption”, Proceedings of the Workshop on Selected Areas of Cryptography, pp. 120-128, 1994.
 R. Rivest, A. Shamir and L. Adleman, “A method for obtaining digital signatures and public-key cryptosystems”, Comm. ACM vol.21, pp. 120-126, 1977.
 D. Boneh, EJ. Goh, and K. Nissim, “Evaluating 2-DNF formulas on ciphertexts”, Proceedings of Thepry of Cryptography (TCC), pp. 325-341, 2005.
 M. Hirt and K. Sako, “Efficient receipt-Free voting based on homomorphic encryption”, Proceedings of (Eurocrypt’00), LNCS vol. 1807, pp.539-556, 2000.
 B. Hemenway and R. Ostrovsky, “Lossy trapdoor functions from smooth homomorphic hasgh proof systems”, In Electronic Colloquium on Computational Complexity, Report TR09-127, 2009.
 C. Gentry and Z. Ramzan, “Single-database private information retrieval with constant communication rate”, Proceedings of ICALP 2005, pp.803-815, 2005.
 J. Bernstein and Tenja Lange, “Post-Quantum cryptography”, Nature 549, 188-194, 2017.
 S. F. Ciou, “Two-party equality test with privacy protection”, Master’s Thesis, 2011. (in Chinese)
 S. F. Ciou, R.Tso, “A privacy preserved two-party equality testing protocol”, Proceedings of ICGEC 2011, pp. 220-223, 2011.
 Naoki Ogura, Go Yamamoto, Tetsutaro Kobayashi, Shigenori Uchiyama, “An Improvement of Key Generation Algorithm for Gentry’s Homomorphic Encryption Scheme” International Workshop on Security(IWSEC 2010). Pp. 70-83, 2010.
 Peter Scholl and Nigel P. Smart, “Improved key generation for Gentry’s fully homomorphic encryption scheme”, IMACC’11, pp.10-22, 2011.
 Craig Gentry and Shai Halevi, ”Implementing Gentry’s Fully-Homomorphic Encryption Scheme” Proceedings of Advances in Cryptology (Eurocrypt’2011) pp.129-148
|Source URI: ||http://thesis.lib.nccu.edu.tw/record/#G0104971004|
|Data Type: ||thesis|
|Appears in Collections:||[資訊科學系碩士在職專班] 學位論文|
Files in This Item:
All items in 政大典藏 are protected by copyright, with all rights reserved.