2009 |
29 | EE | Charanjit S. Jutla,
Anindya C. Patthak:
Provably Good Codes for Hash Function Design.
IEEE Transactions on Information Theory 55(1): 33-45 (2009) |
2008 |
28 | EE | Don Coppersmith,
Jean-Sébastien Coron,
François Grieu,
Shai Halevi,
Charanjit S. Jutla,
David Naccache,
Julien P. Stern:
Cryptanalysis of ISO/IEC 9796-1.
J. Cryptology 21(1): 27-51 (2008) |
27 | EE | Charanjit S. Jutla:
Encryption Modes with Almost Free Message Integrity.
J. Cryptology 21(4): 547-578 (2008) |
2006 |
26 | EE | Charanjit S. Jutla,
Anindya C. Patthak:
Provably Good Codes for Hash Function Design.
Selected Areas in Cryptography 2006: 376-393 |
25 | EE | Charanjit S. Jutla:
PRF Domain Extension Using DAGs.
TCC 2006: 561-580 |
24 | EE | Charanjit S. Jutla:
A Simple Biased Distribution for Dinur's Construction.
Electronic Colloquium on Computational Complexity (ECCC) 13(121): (2006) |
2005 |
23 | EE | W. Eric Hall,
Charanjit S. Jutla:
Parallelizable Authentication Trees.
Selected Areas in Cryptography 2005: 95-109 |
2004 |
22 | EE | Charanjit S. Jutla,
Anindya C. Patthak,
Atri Rudra,
David Zuckerman:
Testing Low-Degree Polynomials over Prime Fields.
FOCS 2004: 423-432 |
2003 |
21 | EE | Charanjit S. Jutla:
Lower Bound on Linear Authenticated Encryption.
Selected Areas in Cryptography 2003: 348-360 |
2002 |
20 | EE | Don Coppersmith,
Shai Halevi,
Charanjit S. Jutla:
Cryptanalysis of Stream Ciphers with Linear Masking.
CRYPTO 2002: 515-532 |
19 | EE | Shai Halevi,
Don Coppersmith,
Charanjit S. Jutla:
Scream: A Software-Efficient Stream Cipher.
FSE 2002: 195-209 |
2001 |
18 | EE | Atri Rudra,
Pradeep K. Dubey,
Charanjit S. Jutla,
Vijay Kumar,
Josyula R. Rao,
Pankaj Rohatgi:
Efficient Rijndael Encryption Implementation with Composite Field Arithmetic.
CHES 2001: 171-184 |
17 | EE | Charanjit S. Jutla:
Encryption Modes with Almost Free Message Integrity.
EUROCRYPT 2001: 529-544 |
16 | EE | E. Allen Emerson,
Charanjit S. Jutla,
A. Prasad Sistla:
On model checking for the µ-calculus and its fragments.
Theor. Comput. Sci. 258(1-2): 491-522 (2001) |
2000 |
15 | | Don Coppersmith,
Rosario Gennaro,
Shai Halevi,
Charanjit S. Jutla,
Stephen M. Matyas,
Mohammad Peyravian,
David Safford,
Nevenko Zunic:
IBM Comments.
AES Candidate Conference 2000: 333-336 |
14 | EE | Juan A. Garay,
Rosario Gennaro,
Charanjit S. Jutla,
Tal Rabin:
Secure distributed storage and retrieval.
Theor. Comput. Sci. 243(1-2): 363-389 (2000) |
1999 |
13 | EE | Suresh Chari,
Charanjit S. Jutla,
Josyula R. Rao,
Pankaj Rohatgi:
Towards Sound Approaches to Counteract Power-Analysis Attacks.
CRYPTO 1999: 398-412 |
12 | | E. Allen Emerson,
Charanjit S. Jutla:
The Complexity of Tree Automata and Logics of Programs.
SIAM J. Comput. 29(1): 132-158 (1999) |
1998 |
11 | EE | Charanjit S. Jutla:
Generalized Birthday Arracks on Unbalanced Feistel Networks.
CRYPTO 1998: 186-199 |
10 | EE | Charanjit S. Jutla:
On Finding Small Solutions of Modular Multivariate Polynomial Equations.
EUROCRYPT 1998: 158-170 |
1997 |
9 | | Juan A. Garay,
Rosario Gennaro,
Charanjit S. Jutla,
Tal Rabin:
Secure Distributed Storage and Retrieval.
WDAG 1997: 275-289 |
8 | | Charanjit S. Jutla,
Josyula R. Rao:
A Methodology for Designing Proof Rules for Fair Parallel Programs.
Formal Asp. Comput. 9(4): 359-378 (1997) |
7 | | Charanjit S. Jutla:
Determinization and Memoryless Winning Strategies.
Inf. Comput. 133(2): 117-134 (1997) |
1993 |
6 | | E. Allen Emerson,
Charanjit S. Jutla,
A. Prasad Sistla:
On Model-Checking for Fragments of µ-Calculus.
CAV 1993: 385-396 |
5 | | Daniel M. Yellin,
Charanjit S. Jutla:
Finding Extremal Sets in Less than Quadratic Time.
Inf. Process. Lett. 48(1): 29-34 (1993) |
1991 |
4 | | E. Allen Emerson,
Charanjit S. Jutla:
Tree Automata, Mu-Calculus and Determinacy (Extended Abstract)
FOCS 1991: 368-377 |
1989 |
3 | | E. Allen Emerson,
Charanjit S. Jutla:
On Simultaneously Determinizing and Complementing omega-Automata (Extended Abstract)
LICS 1989: 333-342 |
2 | | Charanjit S. Jutla,
Edgar Knapp,
Josyula R. Rao:
A Predicate Transformer Approach to Semantics of Parallel Programs.
PODC 1989: 249-263 |
1988 |
1 | | E. Allen Emerson,
Charanjit S. Jutla:
The Complexity of Tree Automata and Logics of Programs (Extended Abstract)
FOCS 1988: 328-337 |