| Download ( PDF | 89kB) |
Reducing the Complexity in the Distributed Multiplication Protocol of Two Polynomially Shared Values
Book section
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.DOI to cite this document: 10.5283/epub.5614
Alternative links to fulltext
Involved Institutions
Details
| Item type | Book section |
| ISBN | 0-7695-2847-3; 978-0-7695-2847-2 |
| Title of Book | Proceedings of the 21st International Conference on Advanced Networking and Applications (AINA 2007), Symposium on Security in Networks and Distributed Systems (SSNDS-07) |
| Publisher | IEEE Computer Society |
| Place of Publication | Los Alamitos, Calif. |
| Page Range | pp. 415-419 |
| Date | 2007 |
| Date of publication | 05 Aug 2009 13:50 |
| 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 |
| URN of the UB Regensburg | urn:nbn:de:bvb:355-epub-56144 |
| Item ID | 5614 |
Export bibliographical data
Owner only: item control page
Download Statistics
Download Statistics