Google Groups no longer supports new Usenet posts or subscriptions. Historical content remains viewable.
Dismiss

Covert Computation, or how to reveal your secret crush, negotiate

0 views
Skip to first unread message

Christina Johnson

unread,
Sep 23, 2004, 11:05:14 AM9/23/04
to
This message is in MIME format. Since your mail reader does not understand
this format, some or all of this message may not be legible.

------_=_NextPart_001_01C4A17E.BA9C4050
Content-Type: text/plain


Covert Computation, or how to reveal your secret crush, negotiate a bribe,
and more...

Nick Hopper
Dept. of Computer Science and Engineering
University of Minnesota
September 27, 2004
11:15 a.m. - 12:15 p.m.
EE/CS 3-125

In this talk, I will introduce the concept of covert two-party computation.
Whereas ordinary secure two-party computation only guarantees that no more
knowledge is leaked about the inputs of the individual parties than the
result of the computation, covert two-party computation employs
steganography to ensure that unless the result of a computation is in some
set of interest, neither party can even tell whether the other ran the
protocol. I will introduce security definitions for covert two-party
computation and show how to construct protocols with provable security based
on the Decisional Diffie-Hellman assumption. In addition, I will briefly
outline a graduate seminar course on cryptography to be offered this spring.


------_=_NextPart_001_01C4A17E.BA9C4050
Content-Type: text/html
Content-Transfer-Encoding: quoted-printable

<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2//EN">
<HTML>
<HEAD>
<META HTTP-EQUIV=3D"Content-Type" CONTENT=3D"text/html; =
charset=3Dus-ascii">
<META NAME=3D"Generator" CONTENT=3D"MS Exchange Server version =
5.5.2653.12">
<TITLE>Covert Computation, or how to reveal your secret crush, =
negotiate a bribe, and more...</TITLE>
</HEAD>
<BODY>
<BR>

<P><B><FONT FACE=3D"Arial">Covert Computation, or how to reveal your =
secret crush, negotiate a bribe, and more...</FONT></B>
</P>

<P><FONT FACE=3D"Arial">Nick Hopper</FONT>
<BR><FONT FACE=3D"Arial">Dept. of Computer Science and =
Engineering</FONT>
<BR><FONT FACE=3D"Arial">University of Minnesota</FONT>
<BR><FONT FACE=3D"Arial">September 27, 2004</FONT>
<BR><FONT FACE=3D"Arial">11:15 a.m. - 12:15 p.m.</FONT>
<BR><FONT FACE=3D"Arial">EE/CS 3-125</FONT>
</P>

<P><FONT FACE=3D"Arial">In this talk, I will introduce the concept of =
covert two-party computation. Whereas ordinary secure two-party =
computation only guarantees that no more knowledge is leaked about the =
inputs of the individual parties than the result of the computation, =
covert two-party computation employs steganography to ensure that =
unless the result of a computation is in some set of interest, neither =
party can even tell whether the other ran the protocol. I will =
introduce security definitions for covert two-party computation and =
show how to construct protocols with provable security based on the =
Decisional Diffie-Hellman assumption. In addition, I will briefly =
outline a graduate seminar course on cryptography to be offered this =
spring.</FONT></P>

</BODY>
</HTML>
------_=_NextPart_001_01C4A17E.BA9C4050--

0 new messages