Secure computations in minimal model using simple ESCT decomposition

DSpace/Manakin Repository

Show simple item record

dc.contributor.author Sampson, M en
dc.contributor.author Voudouris, D en
dc.contributor.author Papakonstantinou, G en
dc.date.accessioned 2014-03-01T02:45:46Z
dc.date.available 2014-03-01T02:45:46Z
dc.date.issued 2008 en
dc.identifier.uri http://hdl.handle.net/123456789/32385
dc.subject Cryptographic Protocol en
dc.subject Minimal Model en
dc.subject Secure Computation en
dc.subject.other Computers en
dc.subject.other Cryptography en
dc.subject.other Internet en
dc.subject.other Cryptographic protocols en
dc.subject.other Minimal models en
dc.subject.other Secure computations en
dc.subject.other Computer networks en
dc.title Secure computations in minimal model using simple ESCT decomposition en
heal.type conferenceItem en
heal.identifier.primary 10.1109/SOFTCOM.2008.4669514 en
heal.identifier.secondary http://dx.doi.org/10.1109/SOFTCOM.2008.4669514 en
heal.identifier.secondary 4669514 en
heal.publicationDate 2008 en
heal.abstract This paper deals with the use of a minimal model for performing secure computations. The communication is based on a protocol which makes use of minimal ESCT (Exclusive-or Sum of Complex Terms) expressions in order to perform a secure computation. The complexity of this protocol is directly proportional to the size of the ESCT expression in use, which is much smaller in comparison to other proposed minimal models (e.g. ESOP). Hence, this paper provides a very usefully application of the ESCT expressions in the field of cryptographic protocols. en
heal.journalName SoftCom 2008: 16th International Conference on Software, Telecommuncations and Computer Networks en
dc.identifier.doi 10.1109/SOFTCOM.2008.4669514 en
dc.identifier.spage 380 en
dc.identifier.epage 383 en

Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record