English  |  正體中文  |  简体中文  |  Items with full text/Total items : 28351/40344
Visitors : 4099408      Online Users : 110
RC Version 4.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Adv. Search

Please use this identifier to cite or link to this item: http://ntour.ntou.edu.tw:8080/ir/handle/987654321/27800

Title: Distributed Paillier Plaintext Equivalence Test
Authors: Pei-yih Ting;Xiao-wei Huan
Contributors: NTOU:Department of Computer Science and Engineering
Keywords: Homomorphic encryption;PET;plaintext equivalence test;secure multi-party computation protocol
Date: 2008-05
Issue Date: 2011-10-21T02:34:03Z
Publisher: International Journal of Network Security
Abstract: Abstract:Consider the following scenario with N +2 parties, A, B, X1, X2, ???, XN. Party A has a secret a, party B has a secret b, and party Xi has a secret xi, for i = 1, ???,N. They want to know if a = b without revealing any information about their secrets. We propose a distributed protocol for this problem based on the Paillier threshold homomorphic encryption scheme with a public broadcast channel. This protocol is suitable for voting which requires public verifiability. This protocol is secure and robust in an honest majority environment. We proved the security in a formal framework for secure multi-party computation.
Relation: 6(3), pp.258-264
URI: http://ntour.ntou.edu.tw/handle/987654321/27800
Appears in Collections:[資訊工程學系] 期刊論文

Files in This Item:

File Description SizeFormat

All items in NTOUR are protected by copyright, with all rights reserved.


著作權政策宣告: 本網站之內容為國立臺灣海洋大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用,請合理使用本網站之內容,以尊重著作權人之權益。
網站維護: 海大圖資處 圖書系統組
DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback