OpenAlex
PricingAboutJobs
Log inGet started
Work

Highly Efficient and Re-executable Private Function Evaluation with Linear Complexity

HTML

Year: 2020
Type: article
Source: IEEE Transactions on Dependable and Secure Computing
DOI: 10.1109/tdsc.2020.3009496
Authors: Osman Bicer, Muhammed Ali Bingol, Mehmet Sabir Kiraz, Albert Levi
Institutions: Koç University, Sabancı Üniversitesi, De Montfort University, nChain (United Kingdom)
Language: English

Topic: Cryptography and Data Security
Subfield: Computer Networks and Communications
Field: Computer Science
Domain: Physical Sciences
Keywords: two-party computation, reusability, DDH assumption, secure multi-party computation, constant-round protocols

Open Access status: closed
OpenAlex ID: W3043365475
FWCI: 0.878
Cites: 48
Cited by: 12
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