Sie befinden Sich nicht im Netzwerk der Universität Paderborn. Der Zugriff auf elektronische Ressourcen ist gegebenenfalls nur via VPN oder Shibboleth (DFN-AAI) möglich. mehr Informationen...
Ergebnis 21 von 27
2008 IEEE International Conference on Granular Computing, 2008, p.556-561
2008
Volltextzugriff (PDF)

Details

Autor(en) / Beteiligte
Titel
Scalar-product based secure two-party computation
Ist Teil von
  • 2008 IEEE International Conference on Granular Computing, 2008, p.556-561
Ort / Verlag
IEEE
Erscheinungsjahr
2008
Quelle
IEEE/IET Electronic Library (IEL)
Beschreibungen/Notizen
  • Secure multiparty computation is a very important research topic in cryptography. The sub-problem of secure multiparty computation that has received special attention by researchers because of its close relation to many cryptographic tasks is secure two-party computation. This area of research is concerned with the question: ldquoCan two party computation be achieved more efficiently and under weaker security assumptions than general multiparty computation?rdquo Yaopsilas protocol provided security against passive adversaries, while Lindell and Pinkas proposed secure two party protocols that are secure against active adversaries. In this paper, we would like to propose a set of information theoretically secure protocols based on scalar product protocol. The detailed complexity analysis is also provided.
Sprache
Englisch
Identifikatoren
ISBN: 1424425123, 9781424425129
DOI: 10.1109/GRC.2008.4664775
Titel-ID: cdi_ieee_primary_4664775

Weiterführende Literatur

Empfehlungen zum selben Thema automatisch vorgeschlagen von bX