P. Sarkar

Publications
Influence

Nonlinearity Bounds and Constructions of Resilient Boolean Functions

P. Sarkar, S. Maitra
Mathematics, Computer Science
CRYPTO
20 August 2000

We first prove a sharper version of McEliece theorem for Reed-Muller codes as applied to resilient functions, which also generalizes Xiao-Massey characterization. Expand

A brief history of cellular automata

P. Sarkar
Computer Science
CSUR
1 March 2000

We trace the history of cellular automata from their beginnings with von Neumann to the present day. Expand

Construction of Nonlinear Boolean Functions with Important Cryptographic Properties

P. Sarkar, S. Maitra
Mathematics, Computer Science
EUROCRYPT
14 May 2000

We obtain better results than all published works on the construction of n-variable, m-resilient functions, including cases where the constructed functions have the maximum possible algebraic degree n - m - 1. Expand

Spectral Domain Analysis of Correlation Immune and Resilient Boolean Functions

P. Sarkar
Mathematics, Computer Science
IACR Cryptol. ePrint Arch.
2000

We use a general property of Fourier transform to obtain direct proofs of recent divisibility results on the Walsh transform of correlation immune and resilient functions. Expand

HIBE With Short Public Parameters Without Random Oracle

Sanjit Chatterjee, P. Sarkar
Computer Science
ASIACRYPT
3 December 2006

We extend Waters' IBE protocol to a hierarchical IBE (HIBE) protocol which is secure in the full model without random oracle. Expand

Extending Joux's Protocol to Multi Party Key Agreement (Extended Abstract)

R. Barua, Ratna Dutta, P. Sarkar
Computer Science
INDOCRYPT
8 December 2003

We present a secure unauthenticated as well as an authenticated multi party key agreement protocol that is more efficient than all previously known authenticated key agreement protocols. Expand

Trading Time for Space: Towards an Efficient IBE Scheme with Short(er) Public Parameters in the Standard Model

Sanjit Chatterjee, P. Sarkar
Computer Science, Mathematics
ICISC
1 December 2005

We show that if one tries to reduce the number of elements in the public parameter then there is a corresponding degradation in the security reduction and smallness of public parameter. Expand

Pairing-Based Cryptographic Protocols : A Survey

Ratna Dutta, R. Barua, P. Sarkar
Computer Science
IACR Cryptol. ePrint Arch.
2004

We have tried to cover different cryptographic protocols based on bilinear pairings which possess, to the best of our knowledge, proper security proofs in the existing security models. Expand

Multi-receiver Identity-Based Key Encapsulation with Shortened Ciphertext

Sanjit Chatterjee, P. Sarkar
Computer Science
INDOCRYPT
11 December 2006

This paper describes two identity based encryption (IBE) protocols in the multi-receiver setting. Expand

New Constructions of Constant Size Ciphertext HIBE Without Random Oracle

Sanjit Chatterjee, P. Sarkar
Computer Science, Mathematics
ICISC
30 November 2006

We present two variants of the BBG-HIBE secure in a generalization of the selective-ID model while the second variant is proved to be secure in the full security model. Expand

Recommended Authors