OpenAlex
PricingAboutJobs
Log inGet started
Work

Perfect Constant-Round Secure Computation via Perfect Randomizing Polynomials

HTML

Year: 2002
Type: conference-paper
Source: Lecture notes in computer science
Parent work: Automata, Languages and Programming: 29th International Colloquium, ICALP 2002 Málaga, Spain, July 8–13, 2002 Proceedings
DOI: 10.1007/3-540-45465-9_22
Authors: Yuval Ishai, Eyal Kushilevitz
Institutions: Princeton University, Technion – Israel Institute of Technology
Language: English

Topic: Cryptography and Data Security
Subfield: Computer Networks and Communications
Field: Computer Science
Domain: Physical Sciences
Keywords: secure multi-party computation, constant-round protocols, information-theoretic security, NC1 circuits, branching programs, Boolean functions

Open Access status: closed
OpenAlex ID: W1607960089
FWCI: 1.623
Cites: 30
Cited by: 198
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