Loading...
Please wait, while we are loading the content...
Similar Documents
Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation
| Content Provider | CiteSeerX |
|---|---|
| Author | Hirt, Martin Nielsen, Jesper Buus |
| File Format | |
| Language | English |
| Publisher Institution | In Proc. Asiacrypt 2005 |
| Access Restriction | Open |
| Subject Keyword | Simple Observation Optimal Resilience New Protocol Cryptographic Model Communication Complexity N-party Randomized Function Upper Bound Active Security Security Parameter Optimally-resilient Secure Multiparty Computation Optimally Resilient Cryptographic Multiparty Computation Previous Protocol Whole Protocol Execution Passive Secure Multiparty Computation |
| Content Type | Text |
| Resource Type | Article |