OpenAlex
PricingAboutJobs
Log inGet started
Work

Efficient Scalable Constant-Round MPC via Garbled Circuits

HTML

Year: 2017
Type: conference-paper
Source: Lecture notes in computer science
Parent work: Advances in Cryptology – ASIACRYPT 2017: 23rd International Conference on the Theory and Applications of Cryptology and Information Security, Hong Kong, China, December 3-7, 2017, Proceedings, Part II
DOI: 10.1007/978-3-319-70697-9_17
Authors: Aner Ben-Efraim, Yehuda Lindell, Eran Omri
Institutions: Ben-Gurion University of the Negev, Bar-Ilan University, Ariel University
Language: English

Topic: Cryptography and Data Security
Subfield: Computer Networks and Communications
Field: Computer Science
Domain: Physical Sciences
Keywords: secure multi-party computation, garbled circuits, constant-round protocols, semi-honest adversaries, ring learning with errors

Open Access status: closed
OpenAlex ID: W2770795779
FWCI: 1.17
Cites: 38
Cited by: 30
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