Charanjit S. Jutla

According to our database1, Charanjit S. Jutla authored at least 69 papers between 1988 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
A Novel Power-Sum PRG with Applications to Lattice-Based zkSNARKs.
IACR Cryptol. ePrint Arch., 2023

Ring-LWE Hardness Based on Ideals of Hidden Orders of Number Fields.
IACR Cryptol. ePrint Arch., 2023

2022
Improved Stock Market Structure Using Cryptography.
IACR Cryptol. ePrint Arch., 2022

Enhancing Ring-LWE Hardness using Dedekind Index Theorem.
IACR Cryptol. ePrint Arch., 2022

Secure Storage with Deduplication.
IACR Cryptol. ePrint Arch., 2022

2021
Efficient Searchable Symmetric Encryption for Join Queries.
IACR Cryptol. ePrint Arch., 2021

Sine Series Approximation of the Mod Function for Bootstrapping of Approximate HE.
IACR Cryptol. ePrint Arch., 2021

Inflation-Tracking Proof-of-Work Crypto-Currencies.
IACR Cryptol. ePrint Arch., 2021

2020
Modular Lagrange Interpolation of the Mod Function for Bootstrapping for Approximate HE.
IACR Cryptol. ePrint Arch., 2020

EM-Side-Channel Resistant Symmetric-Key Authentication Mechanism for Small Devices.
IACR Cryptol. ePrint Arch., 2020

2019
Shorter QA-NIZK and SPS with Tighter Security.
IACR Cryptol. ePrint Arch., 2019

Initial Public Offering (IPO) on Permissioned Blockchain Using Secure Multiparty Computation.
Proceedings of the IEEE International Conference on Blockchain, 2019

2018
Improved (Almost) Tightly-Secure Structure-Preserving Signatures.
IACR Cryptol. ePrint Arch., 2018

Authenticated Encryption Mode IAPM using SHA-3's Public Random Permutation.
IACR Cryptol. ePrint Arch., 2018

Improved (Almost) Tightly-Secure Simulation-Sound QA-NIZK with Applications.
IACR Cryptol. ePrint Arch., 2018

Obfuscation using Tensor Products.
Electron. Colloquium Comput. Complex., 2018

Smooth NIZK Arguments.
Proceedings of the Theory of Cryptography - 16th International Conference, 2018

2017
Shorter Quasi-Adaptive NIZK Proofs for Linear Subspaces.
J. Cryptol., 2017

Improved Structure Preserving Signatures under Standard Bilinear Assumptions.
IACR Cryptol. ePrint Arch., 2017

2016
Smooth NIZK Arguments with Applications to Asymmetric UC-PAKE.
IACR Cryptol. ePrint Arch., 2016

2015
Upending Stock Market Structure Using Secure Multi-Party Computation.
IACR Cryptol. ePrint Arch., 2015

Weak Ideal Functionalities for Designing Random Oracles with Applications to Fugue.
IACR Cryptol. ePrint Arch., 2015

2014
Dual-System Simulation-Soundness with Applications to UC-PAKE and More.
IACR Cryptol. ePrint Arch., 2014

The Hash Function "Fugue".
IACR Cryptol. ePrint Arch., 2014

Private Database Access With HE-over-ORAM Architecture.
IACR Cryptol. ePrint Arch., 2014

Dynamic Searchable Encryption in Very-Large Databases: Data Structures and Implementation.
IACR Cryptol. ePrint Arch., 2014

2013
Switching Lemma for Bilinear Tests and Constant-size NIZK Proofs for Linear Subspaces.
IACR Cryptol. ePrint Arch., 2013

Outsourced Symmetric Private Information Retrieval.
IACR Cryptol. ePrint Arch., 2013

Optimizing ORAM and Using it Efficiently for Secure Computation.
IACR Cryptol. ePrint Arch., 2013

Highly-Scalable Searchable Symmetric Encryption with Support for Boolean Queries.
IACR Cryptol. ePrint Arch., 2013

2012
PayTree: "Amortized Signature" for Flexible Micro-Payments.
IACR Cryptol. ePrint Arch., 2012

On the Circuit Complexity of Composite Galois Field Transformations.
Electron. Colloquium Comput. Complex., 2012

Decision Procedures for Simulatability.
Proceedings of the Computer Security - ESORICS 2012, 2012

2011
Relatively-Sound NIZKs and Password-Based Key-Exchange.
IACR Cryptol. ePrint Arch., 2011

Universally Composable Security Analysis of OAuth v2.0.
IACR Cryptol. ePrint Arch., 2011

2010
A Completeness Theorem for Pseudo-Linear Functions with Applications to UC Security.
Electron. Colloquium Comput. Complex., 2010

2009
Provably Good Codes for Hash Function Design.
IEEE Trans. Inf. Theory, 2009

Testing low-degree polynomials over prime fields.
Random Struct. Algorithms, 2009

Almost Optimal Bounds for Direct Product Threshold Theorem.
Electron. Colloquium Comput. Complex., 2009

2008
Encryption Modes with Almost Free Message Integrity.
J. Cryptol., 2008

Cryptanalysis of ISO/IEC 9796-1.
J. Cryptol., 2008

2007
Utility Sampling for Trust Metrics in PKI.
IACR Cryptol. ePrint Arch., 2007

2006
A Simple Biased Distribution for Dinur's Construction.
Electron. Colloquium Comput. Complex., 2006

2005
Is SHA-1 conceptually sound?
IACR Cryptol. ePrint Arch., 2005

A Matching Lower Bound on the Minimum Weight of SHA-1 Expansion Code.
IACR Cryptol. ePrint Arch., 2005

A Simple and Provably Good Code for SHA Message Expansion.
IACR Cryptol. ePrint Arch., 2005

PRF Domain Extension Using DAGs.
IACR Cryptol. ePrint Arch., 2005

2003
Lower Bound on Linear Authenticated Encryption.
Proceedings of the Selected Areas in Cryptography, 10th Annual International Workshop, 2003

2002
Tight Lower Bound on Linear Authenticated Encryption.
IACR Cryptol. ePrint Arch., 2002

Parallelizable Authentication Trees.
IACR Cryptol. ePrint Arch., 2002

Scream: a software-efficient stream cipher.
IACR Cryptol. ePrint Arch., 2002

Cryptanalysis of stream ciphers with linear masking.
IACR Cryptol. ePrint Arch., 2002

2001
On model checking for the µ-calculus and its fragments.
Theor. Comput. Sci., 2001

Efficient Rijndael Encryption Implementation with Composite Field Arithmetic.
Proceedings of the Cryptographic Hardware and Embedded Systems, 2001

2000
Secure distributed storage and retrieval.
Theor. Comput. Sci., 2000

IBM Comments.
Proceedings of the Third Advanced Encryption Standard Candidate Conference, 2000

1999
The Complexity of Tree Automata and Logics of Programs.
SIAM J. Comput., 1999

Towards Sound Approaches to Counteract Power-Analysis Attacks.
Proceedings of the Advances in Cryptology, 1999

1998
VarietyCash: A Multi-Purpose Electronic Payment System.
Proceedings of the 3rd USENIX Workshop on Electronic Commerce, Boston, Massachusetts, USA, August 31, 1998

On Finding Small Solutions of Modular Multivariate Polynomial Equations.
Proceedings of the Advances in Cryptology - EUROCRYPT '98, International Conference on the Theory and Application of Cryptographic Techniques, Espoo, Finland, May 31, 1998

Generalized Birthday Arracks on Unbalanced Feistel Networks.
Proceedings of the Advances in Cryptology, 1998

1997
Determinization and Memoryless Winning Strategies.
Inf. Comput., 1997

A Methodology for Designing Proof Rules for Fair Parallel Programs.
Formal Aspects Comput., 1997

1993
Finding Extremal Sets in Less than Quadratic Time.
Inf. Process. Lett., 1993

On Model-Checking for Fragments of µ-Calculus.
Proceedings of the Computer Aided Verification, 5th International Conference, 1993

1991
Tree Automata, Mu-Calculus and Determinacy (Extended Abstract)
Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

1989
A Predicate Transformer Approach to Semantics of Parallel Programs.
Proceedings of the Eighth Annual ACM Symposium on Principles of Distributed Computing, 1989

On Simultaneously Determinizing and Complementing omega-Automata (Extended Abstract)
Proceedings of the Fourth Annual Symposium on Logic in Computer Science (LICS '89), 1989

1988
The Complexity of Tree Automata and Logics of Programs (Extended Abstract)
Proceedings of the 29th Annual Symposium on Foundations of Computer Science, 1988


  Loading...