Cryptographic Primitives
We are active in the design of new encryptions
algorithms, signature schemes, and cryptographic protocols.
Encryption Schemes
The cryptosystem designed by Ronald Cramer and Victor Shoup is
the first practical public-key system that is provably secure against active
attacks. Such attacks are especially devious because, unlike ordinary
attacks, they do not attempt to solve the mathematical problem underlying the
encryption and thus break the code.
-
An expository paper describing the importance
of non-malleability, a.k.a. chosen ciphertext security:
Victor Shoup, Why chosen ciphertext security matters.
IBM Research Report RZ 3076, November, 1998.
(PDF).
-
The technical paper describing the system:
Ronald Cramer and Victor Shoup, A practical public key
cryptosystem provably secure against adaptive
chosen ciphertext attack. Presented at Crypto '98.
Lecture Notes in Computer Science 1462, page 13-25,
Hugo Krawczyk (editor),
Springer-Verlag, Berlin Germany, August 1998.
(PostScript),
(PDF).
-
Some press coverage
(the paper above is more informative for the technically oriented!)
Signature Schemes
We are active in the design of new signature schemes for various applications.
-
A signature scheme based on RSA that can be proven secure under well-defined
intractability assumptions:
Ronald Cramer and Victor Shoup,
Signature schemes based on the Strong RSA Assumption.
Extended abstract in Proc. ACM CCS 1999.
(PostScript).
-
A non-interactive threshold signature scheme based on RSA with
attractive properties:
Victor Shoup,
Practical threshold signatures.
Proc. Eurocrypt 2000.
(PostScript).
-
Confirmer Signatures:
Jan Camenisch and Markus Michels,
Confirmer Signature Schemes Secure against Adaptive Adversaries.
Proc. of Eurocrypt 2000.
(PostScript).
More information and further documentation is available
from our publications list.
