Charanjit S. Jutla

	2012
47		Charanjit S. Jutla, Arnab Roy: Relatively-Sound NIZKs and Password-Based Key-Exchange. Public Key Cryptography 2012: 485-503
46		Charanjit S. Jutla, Moti Yung: PayTree: "Amortized Signature" for Flexible Micro-Payments. IACR Cryptology ePrint Archive 2012: 10 (2012)
	2011
45		Charanjit S. Jutla, Arnab Roy: Relatively-Sound NIZKs and Password-Based Key-Exchange. IACR Cryptology ePrint Archive 2011: 507 (2011)
44		Suresh Chari, Charanjit S. Jutla, Arnab Roy: Universally Composable Security Analysis of OAuth v2.0. IACR Cryptology ePrint Archive 2011: 526 (2011)
	2010
43		Charanjit S. Jutla: Almost Optimal Bounds for Direct Product Threshold Theorem. TCC 2010: 37-51
42		Charanjit S. Jutla, Arnab Roy: A Completeness Theorem for Pseudo-Linear Functions with Applications to UC Security. Electronic Colloquium on Computational Complexity (ECCC) 17: 92 (2010)
	2009
41		Charanjit S. Jutla: Almost Optimal Bounds for Direct Product Threshold Theorem. Electronic Colloquium on Computational Complexity (ECCC) 16: 120 (2009)
40		Charanjit S. Jutla, Anindya C. Patthak: Provably Good Codes for Hash Function Design. IEEE Transactions on Information Theory 55(1): 33-45 (2009)
39		Charanjit S. Jutla, Anindya C. Patthak, Atri Rudra, David Zuckerman: Testing low-degree polynomials over prime fields. Random Struct. Algorithms 35(2): 163-193 (2009)
	2008
38		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)
37		Charanjit S. Jutla: Encryption Modes with Almost Free Message Integrity. J. Cryptology 21(4): 547-578 (2008)
	2007
36		Dakshi Agrawal, Charanjit S. Jutla: Utility Sampling for Trust Metrics in PKI. IACR Cryptology ePrint Archive 2007: 178 (2007)
	2006
35		Charanjit S. Jutla, Anindya C. Patthak: Provably Good Codes for Hash Function Design. Selected Areas in Cryptography 2006: 376-393
34		Charanjit S. Jutla: PRF Domain Extension Using DAGs. TCC 2006: 561-580
33		Charanjit S. Jutla: A Simple Biased Distribution for Dinur's Construction. Electronic Colloquium on Computational Complexity (ECCC) 13(121): (2006)
	2005
32		W. Eric Hall, Charanjit S. Jutla: Parallelizable Authentication Trees. Selected Areas in Cryptography 2005: 95-109
31		Charanjit S. Jutla, Anindya C. Patthak: A Simple and Provably Good Code for SHA Message Expansion. IACR Cryptology ePrint Archive 2005: 247 (2005)
30		Charanjit S. Jutla, Anindya C. Patthak: A Matching Lower Bound on the Minimum Weight of SHA-1 Expansion Code. IACR Cryptology ePrint Archive 2005: 266 (2005)
29		Charanjit S. Jutla, Anindya C. Patthak: Is SHA-1 conceptually sound? IACR Cryptology ePrint Archive 2005: 350 (2005)
28		Charanjit S. Jutla: PRF Domain Extension Using DAGs. IACR Cryptology ePrint Archive 2005: 92 (2005)
	2004
27		Charanjit S. Jutla, Anindya C. Patthak, Atri Rudra, David Zuckerman: Testing Low-Degree Polynomials over Prime Fields. FOCS 2004: 423-432
	2003
26		Charanjit S. Jutla: Lower Bound on Linear Authenticated Encryption. Selected Areas in Cryptography 2003: 348-360
	2002
25		Don Coppersmith, Shai Halevi, Charanjit S. Jutla: Cryptanalysis of Stream Ciphers with Linear Masking. CRYPTO 2002: 515-532
24		Shai Halevi, Don Coppersmith, Charanjit S. Jutla: Scream: A Software-Efficient Stream Cipher. FSE 2002: 195-209
23		Charanjit S. Jutla: Tight Lower Bound on Linear Authenticated Encryption. IACR Cryptology ePrint Archive 2002: 132 (2002)
22		Shai Halevi, Don Coppersmith, Charanjit S. Jutla: Scream: a software-efficient stream cipher. IACR Cryptology ePrint Archive 2002: 19 (2002)
21		W. Eric Hall, Charanjit S. Jutla: Parallelizable Authentication Trees. IACR Cryptology ePrint Archive 2002: 190 (2002)
20		Don Coppersmith, Shai Halevi, Charanjit S. Jutla: Cryptanalysis of stream ciphers with linear masking. IACR Cryptology ePrint Archive 2002: 20 (2002)
	2001
19		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
18		Charanjit S. Jutla: Encryption Modes with Almost Free Message Integrity. EUROCRYPT 2001: 529-544
17		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
16		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
15		Charanjit S. Jutla: Encryption Modes with Almost Free Message Integrity. IACR Cryptology ePrint Archive 2000: 39 (2000)
14		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		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		Charanjit S. Jutla: Generalized Birthday Arracks on Unbalanced Feistel Networks. CRYPTO 1998: 186-199
10		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

Coauthor Index

1	Dakshi Agrawal	[36]
2	Suresh Chari	[13] [44]
3	Don Coppersmith	[16] [20] [22] [24] [25] [38]
4	Jean-Sébastien Coron	[38]
5	Pradeep K. Dubey	[19]
6	E. Allen Emerson	[1] [3] [4] [6] [12] [17]
7	Juan A. Garay	[9] [14]
8	Rosario Gennaro	[9] [14] [16]
9	François Grieu	[38]
10	Shai Halevi	[16] [20] [22] [24] [25] [38]
11	W. Eric Hall	[21] [32]
12	Edgar Knapp	[2]
13	Vijay Kumar	[19]
14	Stephen M. Matyas	[16]
15	David Naccache (Deh Cac Can)	[38]
16	Anindya C. Patthak	[27] [29] [30] [31] [35] [39] [40]
17	Mohammad Peyravian	[16]
18	Tal Rabin	[9] [14]
19	Josyula R. Rao	[2] [8] [13] [19]
20	Pankaj Rohatgi	[13] [19]
21	Arnab Roy	[44] [45] [47]
22	Arnab Roy	[42]
23	Atri Rudra	[19] [27] [39]
24	David Safford	[16]
25	A. Prasad Sistla	[6] [17]
26	Julien P. Stern	[38]
27	Daniel M. Yellin	[5]
28	Moti Yung (Mordechai M. Yung)	[46]
29	David Zuckerman	[27] [39]
30	Nevenko Zunic	[16]

Colors in the list of coauthors

Last update Sat Jun 2 20:57:36 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page