Back to Results
First PageMeta Content
Computability theory / Oracle machine


A preliminary version of this paper appeared in Theory of Cryptography Conference, TCC ’05, Lecture Notes in Computer Science Vol. ???, Joe Kilian ed, Springer Verlag, 2005. This is the full version. Secure Computation
Add to Reading List

Document Date: 2004-12-15 13:27:27


Open Document

File Size: 231,90 KB

Share Result on Facebook

City

La Jolla / Bristol / Bochum / /

Company

Oracle / /

Country

Germany / United States / United Kingdom / /

Currency

pence / /

/

Event

FDA Phase / /

Facility

University of California / University of Bristol / /

IndustryTerm

tailor-made protocol / privacy preserving data-mining / polynomial-time algorithms / log protocol / data processing / polynomial-time algorithm / oracles used by our protocol / computing / pharmaceutical / actual protocol / matrix multiplication protocol / generic solution / /

Organization

Pi / Department of Computer Science / University of Bristol / University of California at San Diego / /

Person

Eike Kiltz∗ Gregor Leander / Gregor Leander† John / Joe Kilian / John Malone-Lee / /

Position

Z. Each player / second player / model for secure twoparty computation / Private / player / /

Product

Cowon D2+ Portable Audio Device / S1 / 2N2 / P1 / N1 / Section / P2 / /

ProvinceOrState

California / /

Technology

probabilistic / polynomial-time algorithm / oracle-aided protocol / Cryptography / 3.4 Protocol / two-party protocol / 3.3 The protocol / two-party protocols / actual protocol / modified protocol / polynomial-time algorithms / OT protocol / tailor-made protocol / A.1 The log protocol / A.2 The mean protocol / A.3 The matrix multiplication protocol / OPE protocol / 4.1 Conversion protocols / 3.5 Protocol / probabilistic / polynomial-time algorithms / /

URL

http /

SocialTag