From: frantz@netcom.com (Bill Frantz)
To: cypherpunks@toad.com
Message Hash: 4584ebb47c44add4bdd6a63ab914fd2b7b4d65152f0f87cf127386fd7bd4ae1e
Message ID: <199610150513.WAA00757@netcom6.netcom.com>
Reply To: N/A
UTC Datetime: 1996-10-15 05:13:34 UTC
Raw Date: Mon, 14 Oct 1996 22:13:34 -0700 (PDT)
From: frantz@netcom.com (Bill Frantz)
Date: Mon, 14 Oct 1996 22:13:34 -0700 (PDT)
To: cypherpunks@toad.com
Subject: Cynthia Dwork talk: Non-Malleable Cryptography
Message-ID: <199610150513.WAA00757@netcom6.netcom.com>
MIME-Version: 1.0
Content-Type: text/plain
Sorry for the late post. I'm way behind in reading my mail.
Bill
--------------Begin forwarded message---------------------
Date: Mon, 14 Oct 1996 09:27:14 -0700
From: "Francois V. Guimbretiere" <francois@cs.stanford.edu>
X-Mailer: Mozilla 2.01 (X11; I; Linux 1.3.48 i586)
To: secure@lists.Stanford.EDU, colloq@cs.stanford.edu
Subject: Cynthia Dwork talk: Non-Malleable Cryptography
Sender: owner-secure@lists.Stanford.EDU
Precedence: bulk
Title: Non-Malleable Cryptography
Speaker: Cynthia Dwork, IBM Almaden Research Center
Time: Tuesday 15 Oct 1996, 4:15pm, Gates 104
ABSTRACT:
The notion of {\it non-malleable} cryptography,
an extension of semantically secure cryptography,
will be defined.
Informally, in the context of encryption
the additional requirement is that
given the ciphertext it is impossible to generate
a {\it different} ciphertext so that the respective
plaintexts are related.
Common public key cryptosystems are quite malleable:
for example, in RSA it is trivial to compute
$E(2x)$ given only $E(x)$.
Although defined with public key cryptography in mind,
non-malleability issues also arise in private-key cryptography.
Indeed, the security of
many common protocols, such as Kerberos, relies
implicitly on the inability of an adversary to compute $E(f(N))$
given only $E(N)$, for simple functions $f$.
The talk will focus on non-malleable public key cryptosystems.
with a few remarks on non-malleable schemes for
private-key cryptography, string commitment,
and proofs of possession of knowledge.
This is joint work with Danny Dolev and Moni Naor.
==========================================================================
This message was posted through the Stanford campus mailing list
server. If you wish to unsubscribe from this mailing list, send the
message body of "unsubscribe secure" to majordomo@lists.stanford.edu
-------------------------------------------------------------------------
Bill Frantz | Tired of Dole/Clinton? | Periwinkle -- Consulting
(408)356-8506 | Vote 3rd party. I'm | 16345 Englewood Ave.
frantz@netcom.com | Voting for Harry Browne | Los Gatos, CA 95032, USA
Return to October 1996
Return to “frantz@netcom.com (Bill Frantz)”
1996-10-15 (Mon, 14 Oct 1996 22:13:34 -0700 (PDT)) - Cynthia Dwork talk: Non-Malleable Cryptography - frantz@netcom.com (Bill Frantz)