You are here:
» On the complexity of verifiable secret sharing and multip...
About Aarhus University
On the complexity of verifiable secret sharing and multiparty computation
Research output: Contribution to book/anthology/report/proceeding › Article in proceedings › Research › peer-review
- Ronald Cramer, Denmark
- Ivan Bjerre Damgård
- Stefan Dziembowski, Denmark
- Department of Computer Science
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the thirty-second annual ACM symposium on Theory of computing |
| Number of pages | 9 |
| Publisher | Association for Computing Machinery |
| Publication year | 2000 |
| Pages | 325-334 |
| ISBN (print) | 1-58113-184-4 |
| DOIs | |
| Publication status | Published - 2000 |
| Event | Annual ACM Symposium on Theory of Computing - Portland, United States Duration: 21 May 2000 → 23 May 2000 Conference number: 32 |
Conference
| Conference | Annual ACM Symposium on Theory of Computing |
|---|---|
| Nummer | 32 |
| Land | United States |
| By | Portland |
| Periode | 21/05/2000 → 23/05/2000 |
See relations at Aarhus University Citationformats
ID: 22047352