Go to content
UR Home

Reducing the Complexity in the Distributed Multiplication Protocol of Two Polynomially Shared Values

Lory, Peter (2007) Reducing the Complexity in the Distributed Multiplication Protocol of Two Polynomially Shared Values. In: Proceedings of the 21st International Conference on Advanced Networking and Applications (AINA 2007), Symposium on Security in Networks and Distributed Systems (SSNDS-07). IEEE Computer Society, Los Alamitos, Calif., pp. 415-419. ISBN 0-7695-2847-3; 978-0-7695-2847-2.

[img]
Preview
PDF
Download (89kB)
Date of publication of this fulltext: 05 Aug 2009 13:50

Other URL: http://ieeexplore.ieee.org/xpl/tocresult.jsp?isnumber=4221006&isYear=2007


Export bibliographical data



Item type:Book section
Date:2007
Institutions:Business, Economics and Information Systems > Institut für Wirtschaftsinformatik > Alumni or Retired Professors > Professur für Wirtschaftsinformatik & Wirtschaftsmathematik (Prof. Dr. Peter Lory)
Dewey Decimal Classification:000 Computer science, information & general works > 000 Generalities, Science
Status:Published
Refereed:Yes, this version has been refereed
Created at the University of Regensburg:Yes
Item ID:5614
Owner only: item control page

Downloads

Downloads per month over past year

  1. Homepage UR

University Library

Publication Server

Contact:

Publishing: oa@ur.de

Dissertations: dissertationen@ur.de

Research data: daten@ur.de

Contact persons