Back to Results
First PageMeta Content
Secure multi-party computation / Computing / Universal composability / Communications protocol / Verifiable secret sharing / Boolean algebra / Π-calculus / Consensus / Cryptographic protocols / Data / Information


An Equational Approach to Secure Multi-party Computation∗ Daniele Micciancio† Stefano Tessaro‡ January 12, 2013
Add to Reading List

Document Date: 2013-09-26 16:14:53

Open Document

File Size: 427,55 KB

Share Result on Facebook

Company

Let us / /

Currency

pence / /

/

Event

FDA Phase / /

Facility

Massachusetts Institute of Technology / University of California / /

IndustryTerm

equivalent systems / widespread tool / classic protocols / multiparty protocol / secure protocols / cryptographic protocols / classic cryptographic protocols / secure computation protocols / verifiable secret sharing protocol / interactive proof systems / multi-party computation protocols / asynchronous distributed systems / knowledge proof systems / communication network / probabilistic systems / secure broadcast protocol / foundational tools / distributed systems / nondeterministic systems / random systems / /

Organization

U.S. Government / Massachusetts Institute of Technology / University of California / San Diego / /

Person

Daniele Micciancio† Stefano Tessaro / /

Position

scheduler / good model for the analysis / /

Product

S0 / Q1 / P1 / Section / /

ProvinceOrState

California / Massachusetts / /

PublishedMedium

Theoretical Computer Science / /

Technology

encryption / two classic cryptographic protocols / cryptography / second protocol / composed protocol / secure broadcast protocol / verifiable secret sharing protocol / computationally secure protocols / two classic protocols / multiparty protocol / MPC protocols / secure computation protocols / studying multi-party computation protocols / secret key / simulation / perfectly secure protocols / 1 protocols / two component protocols / /

SocialTag