default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCharanjit S. Jutla
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[i48]Kostas Kryptos Chalkias, Charanjit S. Jutla, Jonas Lindstrøm, Varun Madathil, Arnab Roy:
Improved Polynomial Division in Cryptography. IACR Cryptol. ePrint Arch. 2024: 1279 (2024)- 2023
- [i47]Charanjit S. Jutla, Chengyu Lin:
Ring-LWE Hardness Based on Ideals of Hidden Orders of Number Fields. IACR Cryptol. ePrint Arch. 2023: 1839 (2023) - [i46]Charanjit S. Jutla, Eamonn W. Postlethwaite, Arnab Roy:
A Novel Power-Sum PRG with Applications to Lattice-Based zkSNARKs. IACR Cryptol. ePrint Arch. 2023: 1858 (2023) - 2022
- [c39]Charanjit S. Jutla, Sikhar Patranabis:
Efficient Searchable Symmetric Encryption for Join Queries. ASIACRYPT (3) 2022: 304-333 - [c38]Charanjit S. Jutla, Nathan Manohar:
Sine Series Approximation of the Mod Function for Bootstrapping of Approximate HE. EUROCRYPT (1) 2022: 491-520 - [i45]Charanjit S. Jutla, Barry Mishra:
Improved Stock Market Structure Using Cryptography. IACR Cryptol. ePrint Arch. 2022: 451 (2022) - [i44]John Best, Wayne Hineman, Steven Hetzler, Guerney Hunt, Charanjit S. Jutla:
Secure Storage with Deduplication. IACR Cryptol. ePrint Arch. 2022: 553 (2022) - [i43]Charanjit S. Jutla, Chengyu Lin:
Enhancing Ring-LWE Hardness using Dedekind Index Theorem. IACR Cryptol. ePrint Arch. 2022: 1631 (2022) - 2021
- [i42]Charanjit S. Jutla, Nathan Manohar:
Sine Series Approximation of the Mod Function for Bootstrapping of Approximate HE. IACR Cryptol. ePrint Arch. 2021: 572 (2021) - [i41]Charanjit S. Jutla, Sikhar Patranabis:
Efficient Searchable Symmetric Encryption for Join Queries. IACR Cryptol. ePrint Arch. 2021: 1471 (2021) - [i40]Charanjit S. Jutla:
Inflation-Tracking Proof-of-Work Crypto-Currencies. IACR Cryptol. ePrint Arch. 2021: 1605 (2021) - 2020
- [i39]Rick Boivie, Charanjit S. Jutla, Daniel Friedman, Ghavam G. Shahidi:
EM-Side-Channel Resistant Symmetric-Key Authentication Mechanism for Small Devices. IACR Cryptol. ePrint Arch. 2020: 966 (2020) - [i38]Charanjit S. Jutla, Nathan Manohar:
Modular Lagrange Interpolation of the Mod Function for Bootstrapping for Approximate HE. IACR Cryptol. ePrint Arch. 2020: 1355 (2020)
2010 – 2019
- 2019
- [c37]Masayuki Abe, Charanjit S. Jutla, Miyako Ohkubo, Jiaxin Pan
, Arnab Roy, Yuyu Wang:
Shorter QA-NIZK and SPS with Tighter Security. ASIACRYPT (3) 2019: 669-699 - [c36]Tzipora Halevi, Fabrice Benhamouda, Angelo De Caro, Shai Halevi, Charanjit S. Jutla, Yacov Manevich, Qi Zhang:
Initial Public Offering (IPO) on Permissioned Blockchain Using Secure Multiparty Computation. Blockchain 2019: 91-98 - [i37]Masayuki Abe, Charanjit S. Jutla, Miyako Ohkubo, Jiaxin Pan, Arnab Roy, Yuyu Wang:
Shorter QA-NIZK and SPS with Tighter Security. IACR Cryptol. ePrint Arch. 2019: 1284 (2019) - 2018
- [c35]Masayuki Abe, Charanjit S. Jutla, Miyako Ohkubo, Arnab Roy:
Improved (Almost) Tightly-Secure Simulation-Sound QA-NIZK with Applications. ASIACRYPT (1) 2018: 627-656 - [c34]Charanjit S. Jutla, Miyako Ohkubo, Arnab Roy:
Improved (Almost) Tightly-Secure Structure-Preserving Signatures. Public Key Cryptography (2) 2018: 123-152 - [c33]Charanjit S. Jutla, Arnab Roy:
Smooth NIZK Arguments. TCC (1) 2018: 235-262 - [i36]Craig Gentry, Charanjit S. Jutla:
Obfuscation using Tensor Products. Electron. Colloquium Comput. Complex. TR18 (2018) - [i35]Charanjit S. Jutla, Miyako Ohkubo, Arnab Roy:
Improved (Almost) Tightly-Secure Structure-Preserving Signatures. IACR Cryptol. ePrint Arch. 2018: 42 (2018) - [i34]Charanjit S. Jutla:
Authenticated Encryption Mode IAPM using SHA-3's Public Random Permutation. IACR Cryptol. ePrint Arch. 2018: 128 (2018) - [i33]Craig Gentry, Charanjit S. Jutla:
Obfuscation Using Tensor Products. IACR Cryptol. ePrint Arch. 2018: 756 (2018) - [i32]Masayuki Abe, Charanjit S. Jutla, Miyako Ohkubo, Arnab Roy:
Improved (Almost) Tightly-Secure Simulation-Sound QA-NIZK with Applications. IACR Cryptol. ePrint Arch. 2018: 849 (2018) - 2017
- [j11]Charanjit S. Jutla, Arnab Roy:
Shorter Quasi-Adaptive NIZK Proofs for Linear Subspaces. J. Cryptol. 30(4): 1116-1156 (2017) - [c32]Charanjit S. Jutla, Arnab Roy:
Improved Structure Preserving Signatures Under Standard Bilinear Assumptions. Public Key Cryptography (2) 2017: 183-209 - [i31]Charanjit S. Jutla, Arnab Roy:
Improved Structure Preserving Signatures under Standard Bilinear Assumptions. IACR Cryptol. ePrint Arch. 2017: 25 (2017) - 2016
- [i30]Charanjit S. Jutla, Arnab Roy:
Smooth NIZK Arguments with Applications to Asymmetric UC-PAKE. IACR Cryptol. ePrint Arch. 2016: 233 (2016) - 2015
- [c31]Craig Gentry, Shai Halevi, Charanjit S. Jutla, Mariana Raykova:
Private Database Access with HE-over-ORAM Architecture. ACNS 2015: 172-191 - [c30]Charanjit S. Jutla, Arnab Roy:
Dual-System Simulation-Soundness with Applications to UC-PAKE and More. ASIACRYPT (1) 2015: 630-655 - [i29]Shai Halevi, William Eric Hall, Charanjit S. Jutla, Arnab Roy:
Weak Ideal Functionalities for Designing Random Oracles with Applications to Fugue. IACR Cryptol. ePrint Arch. 2015: 114 (2015) - [i28]Charanjit S. Jutla:
Upending Stock Market Structure Using Secure Multi-Party Computation. IACR Cryptol. ePrint Arch. 2015: 550 (2015) - 2014
- [c29]Charanjit S. Jutla, Arnab Roy:
Switching Lemma for Bilinear Tests and Constant-Size NIZK Proofs for Linear Subspaces. CRYPTO (2) 2014: 295-312 - [c28]David Cash, Joseph Jaeger, Stanislaw Jarecki, Charanjit S. Jutla, Hugo Krawczyk, Marcel-Catalin Rosu, Michael Steiner:
Dynamic Searchable Encryption in Very-Large Databases: Data Structures and Implementation. NDSS 2014 - [i27]Craig Gentry, Shai Halevi, Charanjit S. Jutla, Mariana Raykova:
Private Database Access With HE-over-ORAM Architecture. IACR Cryptol. ePrint Arch. 2014: 345 (2014) - [i26]Shai Halevi, William Eric Hall, Charanjit S. Jutla:
The Hash Function "Fugue". IACR Cryptol. ePrint Arch. 2014: 423 (2014) - [i25]Charanjit S. Jutla, Arnab Roy:
Dual-System Simulation-Soundness with Applications to UC-PAKE and More. IACR Cryptol. ePrint Arch. 2014: 805 (2014) - [i24]David Cash, Joseph Jaeger, Stanislaw Jarecki, Charanjit S. Jutla, Hugo Krawczyk, Marcel-Catalin Rosu, Michael Steiner:
Dynamic Searchable Encryption in Very-Large Databases: Data Structures and Implementation. IACR Cryptol. ePrint Arch. 2014: 853 (2014) - 2013
- [c27]Charanjit S. Jutla, Arnab Roy:
Shorter Quasi-Adaptive NIZK Proofs for Linear Subspaces. ASIACRYPT (1) 2013: 1-20 - [c26]Stanislaw Jarecki, Charanjit S. Jutla, Hugo Krawczyk, Marcel-Catalin Rosu, Michael Steiner:
Outsourced symmetric private information retrieval. CCS 2013: 875-888 - [c25]David Cash, Stanislaw Jarecki, Charanjit S. Jutla, Hugo Krawczyk, Marcel-Catalin Rosu, Michael Steiner:
Highly-Scalable Searchable Symmetric Encryption with Support for Boolean Queries. CRYPTO (1) 2013: 353-373 - [c24]Craig Gentry, Kenny A. Goldman, Shai Halevi, Charanjit S. Jutla, Mariana Raykova, Daniel Wichs:
Optimizing ORAM and Using It Efficiently for Secure Computation. Privacy Enhancing Technologies 2013: 1-18 - [i23]Charanjit S. Jutla, Arnab Roy:
Shorter Quasi-Adaptive NIZK Proofs for Linear Subspaces. IACR Cryptol. ePrint Arch. 2013: 109 (2013) - [i22]David Cash, Stanislaw Jarecki, Charanjit S. Jutla, Hugo Krawczyk, Marcel-Catalin Rosu, Michael Steiner:
Highly-Scalable Searchable Symmetric Encryption with Support for Boolean Queries. IACR Cryptol. ePrint Arch. 2013: 169 (2013) - [i21]Craig Gentry, Kenny A. Goldman, Shai Halevi, Charanjit S. Jutla, Mariana Raykova, Daniel Wichs:
Optimizing ORAM and Using it Efficiently for Secure Computation. IACR Cryptol. ePrint Arch. 2013: 239 (2013) - [i20]Charanjit S. Jutla, Arnab Roy:
Switching Lemma for Bilinear Tests and Constant-size NIZK Proofs for Linear Subspaces. IACR Cryptol. ePrint Arch. 2013: 670 (2013) - [i19]Stanislaw Jarecki, Charanjit S. Jutla, Hugo Krawczyk, Marcel-Catalin Rosu, Michael Steiner:
Outsourced Symmetric Private Information Retrieval. IACR Cryptol. ePrint Arch. 2013: 720 (2013) - 2012
- [c23]Charanjit S. Jutla, Arnab Roy:
Decision Procedures for Simulatability. ESORICS 2012: 573-590 - [c22]Charanjit S. Jutla, Arnab Roy:
Relatively-Sound NIZKs and Password-Based Key-Exchange. Public Key Cryptography 2012: 485-503 - [i18]Charanjit S. Jutla, Vijay Kumar, Atri Rudra:
On the Circuit Complexity of Composite Galois Field Transformations. Electron. Colloquium Comput. Complex. TR12 (2012) - [i17]Charanjit S. Jutla, Moti Yung:
PayTree: "Amortized Signature" for Flexible Micro-Payments. IACR Cryptol. ePrint Arch. 2012: 10 (2012) - 2011
- [i16]Charanjit S. Jutla, Arnab Roy:
Relatively-Sound NIZKs and Password-Based Key-Exchange. IACR Cryptol. ePrint Arch. 2011: 507 (2011) - [i15]Suresh Chari, Charanjit S. Jutla, Arnab Roy:
Universally Composable Security Analysis of OAuth v2.0. IACR Cryptol. ePrint Arch. 2011: 526 (2011) - 2010
- [c21]Charanjit S. Jutla:
Almost Optimal Bounds for Direct Product Threshold Theorem. TCC 2010: 37-51 - [i14]Charanjit S. Jutla, Arnab Roy:
A Completeness Theorem for Pseudo-Linear Functions with Applications to UC Security. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [j10]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) - [j9]Charanjit S. Jutla, Anindya C. Patthak:
Provably Good Codes for Hash Function Design. IEEE Trans. Inf. Theory 55(1): 33-45 (2009) - [i13]Charanjit S. Jutla:
Almost Optimal Bounds for Direct Product Threshold Theorem. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [j8]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. Cryptol. 21(1): 27-51 (2008) - [j7]Charanjit S. Jutla:
Encryption Modes with Almost Free Message Integrity. J. Cryptol. 21(4): 547-578 (2008) - 2007
- [i12]Dakshi Agrawal, Charanjit S. Jutla:
Utility Sampling for Trust Metrics in PKI. IACR Cryptol. ePrint Arch. 2007: 178 (2007) - 2006
- [c20]Charanjit S. Jutla, Anindya C. Patthak:
Provably Good Codes for Hash Function Design. Selected Areas in Cryptography 2006: 376-393 - [c19]Charanjit S. Jutla:
PRF Domain Extension Using DAGs. TCC 2006: 561-580 - [i11]Charanjit S. Jutla:
A Simple Biased Distribution for Dinur's Construction. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [c18]William Eric Hall, Charanjit S. Jutla:
Parallelizable Authentication Trees. Selected Areas in Cryptography 2005: 95-109 - [i10]Charanjit S. Jutla:
PRF Domain Extension Using DAGs. IACR Cryptol. ePrint Arch. 2005: 92 (2005) - [i9]Charanjit S. Jutla, Anindya C. Patthak:
A Simple and Provably Good Code for SHA Message Expansion. IACR Cryptol. ePrint Arch. 2005: 247 (2005) - [i8]Charanjit S. Jutla, Anindya C. Patthak:
A Matching Lower Bound on the Minimum Weight of SHA-1 Expansion Code. IACR Cryptol. ePrint Arch. 2005: 266 (2005) - [i7]Charanjit S. Jutla, Anindya C. Patthak:
Is SHA-1 conceptually sound? IACR Cryptol. ePrint Arch. 2005: 350 (2005) - 2004
- [c17]Charanjit S. Jutla, Anindya C. Patthak, Atri Rudra, David Zuckerman:
Testing Low-Degree Polynomials over Prime Fields. FOCS 2004: 423-432 - 2003
- [c16]Charanjit S. Jutla:
Lower Bound on Linear Authenticated Encryption. Selected Areas in Cryptography 2003: 348-360 - 2002
- [c15]Don Coppersmith, Shai Halevi, Charanjit S. Jutla:
Cryptanalysis of Stream Ciphers with Linear Masking. CRYPTO 2002: 515-532 - [c14]Shai Halevi, Don Coppersmith, Charanjit S. Jutla:
Scream: A Software-Efficient Stream Cipher. FSE 2002: 195-209 - [i6]Shai Halevi, Don Coppersmith, Charanjit S. Jutla:
Scream: a software-efficient stream cipher. IACR Cryptol. ePrint Arch. 2002: 19 (2002) - [i5]Don Coppersmith, Shai Halevi, Charanjit S. Jutla:
Cryptanalysis of stream ciphers with linear masking. IACR Cryptol. ePrint Arch. 2002: 20 (2002) - [i4]Charanjit S. Jutla:
Tight Lower Bound on Linear Authenticated Encryption. IACR Cryptol. ePrint Arch. 2002: 132 (2002) - [i3]William Eric Hall, Charanjit S. Jutla:
Parallelizable Authentication Trees. IACR Cryptol. ePrint Arch. 2002: 190 (2002) - 2001
- [j6]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) - [c13]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 - [c12]Charanjit S. Jutla:
Encryption Modes with Almost Free Message Integrity. EUROCRYPT 2001: 529-544 - 2000
- [j5]Juan A. Garay, Rosario Gennaro, Charanjit S. Jutla, Tal Rabin:
Secure distributed storage and retrieval. Theor. Comput. Sci. 243(1-2): 363-389 (2000) - [c11]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 - [i2]Charanjit S. Jutla:
Encryption Modes with Almost Free Message Integrity. IACR Cryptol. ePrint Arch. 2000: 39 (2000)
1990 – 1999
- 1999
- [j4]E. Allen Emerson, Charanjit S. Jutla:
The Complexity of Tree Automata and Logics of Programs. SIAM J. Comput. 29(1): 132-158 (1999) - [c10]Suresh Chari, Charanjit S. Jutla, Josyula R. Rao, Pankaj Rohatgi:
Towards Sound Approaches to Counteract Power-Analysis Attacks. CRYPTO 1999: 398-412 - 1998
- [c9]Charanjit S. Jutla:
Generalized Birthday Arracks on Unbalanced Feistel Networks. CRYPTO 1998: 186-199 - [c8]Charanjit S. Jutla:
On Finding Small Solutions of Modular Multivariate Polynomial Equations. EUROCRYPT 1998: 158-170 - [c7]Mihir Bellare, Juan A. Garay, Charanjit S. Jutla, Moti Yung:
VarietyCash: A Multi-Purpose Electronic Payment System. USENIX Workshop on Electronic Commerce 1998 - [i1]Juan A. Garay, Rosario Gennaro, Charanjit S. Jutla, Tal Rabin:
Secure Distributed Storage and Retrieval. IACR Cryptol. ePrint Arch. 1998: 25 (1998) - 1997
- [j3]Charanjit S. Jutla, Josyula R. Rao:
A Methodology for Designing Proof Rules for Fair Parallel Programs. Formal Aspects Comput. 9(4): 359-378 (1997) - [j2]Charanjit S. Jutla:
Determinization and Memoryless Winning Strategies. Inf. Comput. 133(2): 117-134 (1997) - [c6]Juan A. Garay, Rosario Gennaro, Charanjit S. Jutla, Tal Rabin:
Secure Distributed Storage and Retrieval. WDAG 1997: 275-289 - 1993
- [j1]Daniel M. Yellin, Charanjit S. Jutla:
Finding Extremal Sets in Less than Quadratic Time. Inf. Process. Lett. 48(1): 29-34 (1993) - [c5]E. Allen Emerson, Charanjit S. Jutla, A. Prasad Sistla:
On Model-Checking for Fragments of µ-Calculus. CAV 1993: 385-396 - 1991
- [c4]E. Allen Emerson, Charanjit S. Jutla:
Tree Automata, Mu-Calculus and Determinacy (Extended Abstract). FOCS 1991: 368-377
1980 – 1989
- 1989
- [c3]E. Allen Emerson, Charanjit S. Jutla:
On Simultaneously Determinizing and Complementing omega-Automata (Extended Abstract). LICS 1989: 333-342 - [c2]Charanjit S. Jutla, Edgar Knapp, Josyula R. Rao:
A Predicate Transformer Approach to Semantics of Parallel Programs. PODC 1989: 249-263 - 1988
- [c1]E. Allen Emerson, Charanjit S. Jutla:
The Complexity of Tree Automata and Logics of Programs (Extended Abstract). FOCS 1988: 328-337
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-02 21:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
