Number-theoretic cryptography workshop
Oct 16, 2000
to
Oct 20, 2000
Organizer(s)Eric Bach, Dan Boneh, Cynthia Dwork (chair), Shafi Goldwasser, Kevin McCurley and Carl Pomerance
To apply for funding, you must
register by Fri, Oct 20 2000.
This workshop will focus on number-theoretic aspects of cryptography, and will be cross-cultural, where the the cultures in question are "mathematics" and "computer science."
We will be sufficiently flexible to accommodate anything exciting that arises through the fall of 2000, so any plans are tentative. We will have several survey talks on the state of the art of such central topics to number theory in cryptography as
From the computer science side, we will survey
A final survey talk will discuss two historical tracks that met in 1998: practical cryptosystems (RSA, El-Gamal, OAEP, and Cramer-Shoup), and the theory that lead to increasingly stronger notions of security and cryptosystems satisfying these notions (Goldwasser and Micali's construction for semantic security, Naor and Yung's construction for chosen-ciphertext security in the pre-processing mode, Dolev, Dwork and Naor's construction for non-malleability against chosen-ciphertext in the post-processing mode, and Cramer-Shoup's efficient non-malleable cca-post construction).
FundingTo apply for funding, you must
register by Fri, Oct 20 2000.
Click to Register
Students, recent Ph.D.'s, women, and members of underrepresented minorities are particularly encouraged to apply. Funding awards are made typically 6 weeks before the workshop begins. Requests received after the funding deadline are considered only if additional funds become available.
Algorithmic Number Theory
Questions about this workshop should be sent either by email to
or by regular mail to:
The Institute is committed to the principles of Equal Opportunity and Affirmative Action. |
 |