Back to Results
First PageMeta Content
Complexity classes / Probabilistic complexity theory / Zero-knowledge proof / Probabilistically checkable proof / NP / Proof of knowledge / IP / Non-interactive zero-knowledge proof / Soundness / Cryptography / Cryptographic protocols / Theoretical computer science


Secure Two-Party Computation with Low Communication Ivan Damg˚ard∗ Sebastian Faust† Carmit Hazay‡
Add to Reading List

Document Date: 2013-10-04 08:09:02


Open Document

File Size: 221,77 KB

Share Result on Facebook

City

Lausanne / /

Country

Switzerland / China / Israel / Denmark / /

Currency

pence / /

/

Facility

Bar-Ilan University / Aarhus University / /

IndustryTerm

malicious server / generation algorithm / multiparty computation protocol / computation computing / web applications / important applications / obvious solution / round protocol / data mining / proof systems / cloud computing / honest-but-curious solution / encryption algorithm / /

Organization

Danish National Research Foundation / Aarhus University / Bar-Ilan University / National Science Foundation / Department of Computer Science / Sino-Danish Center for the Theory of Interactive Computation / Faculty of Engineering / P2 / /

Person

Sebastian Faust† Carmit Hazay / Ivan Damg / /

Position

author / extractor / CPA / probability CPA / player / /

Technology

encryption / appropriately chosen encryption / multiparty computation protocol / two-message protocol / RAM / two-party protocol / KeyGen algorithm / PPT algorithm / Refresh algorithms / key generation algorithm / public key / encryption algorithm / data mining / round protocol / two PPT algorithms / secret key / random access / simulation / digital signature / three PPT algorithms / 2.1 Public Key Encryption / one round protocol / 2-party UC-secure protocol / 2-message protocol / mobile devices / /

SocialTag