Charanjit S. Jutla

Charanjit S. Jutla, Arnab Roy: Shorter Quasi-Adaptive NIZK Proofs for Linear Subspaces. IACR Cryptology ePrint Archive 2013: 109 (2013)

David Cash, Stanislaw Jarecki, Charanjit S. Jutla, Hugo Krawczyk, Marcel Rosu, Michael Steiner: Highly-Scalable Searchable Symmetric Encryption with Support for Boolean Queries. IACR Cryptology ePrint Archive 2013: 169 (2013)

Charanjit S. Jutla, Arnab Roy: Decision Procedures for Simulatability. ESORICS 2012: 573-590

Charanjit S. Jutla, Arnab Roy: Relatively-Sound NIZKs and Password-Based Key-Exchange. Public Key Cryptography 2012: 485-503

Charanjit S. Jutla, Vijay Kumar, Atri Rudra: On the Circuit Complexity of Composite Galois Field Transformations. Electronic Colloquium on Computational Complexity (ECCC) 19: 93 (2012)

Charanjit S. Jutla, Moti Yung: PayTree: "Amortized Signature" for Flexible Micro-Payments. IACR Cryptology ePrint Archive 2012: 10 (2012)

Charanjit S. Jutla, Arnab Roy: Relatively-Sound NIZKs and Password-Based Key-Exchange. IACR Cryptology ePrint Archive 2011: 507 (2011)

Suresh Chari, Charanjit S. Jutla, Arnab Roy: Universally Composable Security Analysis of OAuth v2.0. IACR Cryptology ePrint Archive 2011: 526 (2011)

Charanjit S. Jutla: Almost Optimal Bounds for Direct Product Threshold Theorem. TCC 2010: 37-51

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)

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)

Charanjit S. Jutla, Anindya C. Patthak: Provably Good Codes for Hash Function Design. IEEE Transactions on Information Theory 55(1): 33-45 (2009)

Charanjit S. Jutla: Almost Optimal Bounds for Direct Product Threshold Theorem. Electronic Colloquium on Computational Complexity (ECCC) 16: 120 (2009)

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)

Charanjit S. Jutla: Encryption Modes with Almost Free Message Integrity. J. Cryptology 21(4): 547-578 (2008)

Dakshi Agrawal, Charanjit S. Jutla: Utility Sampling for Trust Metrics in PKI. IACR Cryptology ePrint Archive 2007: 178 (2007)

Charanjit S. Jutla, Anindya C. Patthak: Provably Good Codes for Hash Function Design. Selected Areas in Cryptography 2006: 376-393

Charanjit S. Jutla: PRF Domain Extension Using DAGs. TCC 2006: 561-580

Charanjit S. Jutla: A Simple Biased Distribution for Dinur's Construction. Electronic Colloquium on Computational Complexity (ECCC) 13(121) (2006)

W. Eric Hall, Charanjit S. Jutla: Parallelizable Authentication Trees. Selected Areas in Cryptography 2005: 95-109

Charanjit S. Jutla: PRF Domain Extension Using DAGs. IACR Cryptology ePrint Archive 2005: 92 (2005)

Charanjit S. Jutla, Anindya C. Patthak: A Simple and Provably Good Code for SHA Message Expansion. IACR Cryptology ePrint Archive 2005: 247 (2005)

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)

Charanjit S. Jutla, Anindya C. Patthak: Is SHA-1 conceptually sound? IACR Cryptology ePrint Archive 2005: 350 (2005)

Charanjit S. Jutla, Anindya C. Patthak, Atri Rudra, David Zuckerman: Testing Low-Degree Polynomials over Prime Fields. FOCS 2004: 423-432

Charanjit S. Jutla: Lower Bound on Linear Authenticated Encryption. Selected Areas in Cryptography 2003: 348-360

Don Coppersmith, Shai Halevi, Charanjit S. Jutla: Cryptanalysis of Stream Ciphers with Linear Masking. CRYPTO 2002: 515-532

Shai Halevi, Don Coppersmith, Charanjit S. Jutla: Scream: A Software-Efficient Stream Cipher. FSE 2002: 195-209

Shai Halevi, Don Coppersmith, Charanjit S. Jutla: Scream: a software-efficient stream cipher. IACR Cryptology ePrint Archive 2002: 19 (2002)

Don Coppersmith, Shai Halevi, Charanjit S. Jutla: Cryptanalysis of stream ciphers with linear masking. IACR Cryptology ePrint Archive 2002: 20 (2002)

Charanjit S. Jutla: Tight Lower Bound on Linear Authenticated Encryption. IACR Cryptology ePrint Archive 2002: 132 (2002)

W. Eric Hall, Charanjit S. Jutla: Parallelizable Authentication Trees. IACR Cryptology ePrint Archive 2002: 190 (2002)

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)

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

Charanjit S. Jutla: Encryption Modes with Almost Free Message Integrity. EUROCRYPT 2001: 529-544

Juan A. Garay, Rosario Gennaro, Charanjit S. Jutla, Tal Rabin: Secure distributed storage and retrieval. Theor. Comput. Sci. 243(1-2): 363-389 (2000)

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

Charanjit S. Jutla: Encryption Modes with Almost Free Message Integrity. IACR Cryptology ePrint Archive 2000: 39 (2000)

E. Allen Emerson, Charanjit S. Jutla: The Complexity of Tree Automata and Logics of Programs. SIAM J. Comput. 29(1): 132-158 (1999)

Suresh Chari, Charanjit S. Jutla, Josyula R. Rao, Pankaj Rohatgi: Towards Sound Approaches to Counteract Power-Analysis Attacks. CRYPTO 1999: 398-412

Charanjit S. Jutla: Generalized Birthday Arracks on Unbalanced Feistel Networks. CRYPTO 1998: 186-199

Charanjit S. Jutla: On Finding Small Solutions of Modular Multivariate Polynomial Equations. EUROCRYPT 1998: 158-170

Charanjit S. Jutla, Josyula R. Rao: A Methodology for Designing Proof Rules for Fair Parallel Programs. Formal Asp. Comput. 9(4): 359-378 (1997)

Charanjit S. Jutla: Determinization and Memoryless Winning Strategies. Inf. Comput. 133(2): 117-134 (1997)

Juan A. Garay, Rosario Gennaro, Charanjit S. Jutla, Tal Rabin: Secure Distributed Storage and Retrieval. WDAG 1997: 275-289

Daniel M. Yellin, Charanjit S. Jutla: Finding Extremal Sets in Less than Quadratic Time. Inf. Process. Lett. 48(1): 29-34 (1993)

E. Allen Emerson, Charanjit S. Jutla, A. Prasad Sistla: On Model-Checking for Fragments of µ-Calculus. CAV 1993: 385-396

E. Allen Emerson, Charanjit S. Jutla: Tree Automata, Mu-Calculus and Determinacy (Extended Abstract). FOCS 1991: 368-377

E. Allen Emerson, Charanjit S. Jutla: On Simultaneously Determinizing and Complementing omega-Automata (Extended Abstract). LICS 1989: 333-342

Charanjit S. Jutla, Edgar Knapp, Josyula R. Rao: A Predicate Transformer Approach to Semantics of Parallel Programs. PODC 1989: 249-263

E. Allen Emerson, Charanjit S. Jutla: The Complexity of Tree Automata and Logics of Programs (Extended Abstract). FOCS 1988: 328-337