OpenAlex
PricingAboutJobs
Log inGet started
Work

Communication Lower Bounds for Statistically Secure MPC, With or Without Preprocessing

HTML

Year: 2019
Type: conference-paper
Source: Lecture notes in computer science
Parent work: Advances in Cryptology – CRYPTO 2019: 39th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18–22, 2019, Proceedings, Part II
DOI: 10.1007/978-3-030-26951-7_3
Authors: Ivan Damgård, Kasper Green Larsen, Jesper Buus Nielsen
Institution: Aarhus University
Language: English

Topic: Cryptography and Data Security
Subfield: Computer Networks and Communications
Field: Computer Science
Domain: Physical Sciences
Keywords: secure multi-party computation, communication complexity lower bounds, statistical security, passive security, Boolean circuits, honest majority, secret sharing, finite fields, secure protocols

Open Access status: closed
OpenAlex ID: W2931602604
FWCI: 2.247
Cites: 22
Cited by: 28
Related to: 10
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Supporters
Legal
Privacy
Accessibility
Terms
Security