Notification:
We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

Secure Dot-product Protocol Using Trace Functions

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Malek, B. ; Sch. of Inf. Technol. & Eng., Ottawa Univ., Ont. ; Miri, A.

In a secure dot-product protocol, two parties jointly compute the dot-product of two vectors of their inputs. In our protocol, the result of a secure dot-product is known only to one party while each input in known only to its owner. This protocol is the first non-interactive secure dot-product protocol that only requires one round of interaction with O(n) communication overhead, where n is the size of the input vectors. The computation overhead of this scheme is negligible as it requires few integer multiplications and additions. In our construction, the sender and the receiver are information theoretically secure over sets E and S* respectively, where E and S* are subsets of the vector space. In our protocol, the security of the sender and the receiver can be increased by choosing large fields

Published in:

Information Theory, 2006 IEEE International Symposium on

Date of Conference:

9-14 July 2006