Pairing-Based Cryptography: A Survey (2009)
Ratna Dutta, Rana Barua, Palash Sarkar
Abstract The bilinear pairing such as Weil pairing or Tate pairing on elliptic and hyperelliptic curves have recently been found positive application in cryptography. Several ID-based cryptosystems...
Overview of Key Agreement Protocols (2008)
The emphasis of this paper is to focus on key agreement. To this aim, we address a selfcontained, up-to-date presentation of key agreement protocols at high level. We have attempted to provide a...
Overview of Key Agreement Protocols (2008)
The emphasis of this paper is to focus on key agreement. To this aim, we address a selfcontained, up-to-date presentation of key agreement protocols at high level. We have attempted to provide a...
An n-party Key Agreement Scheme using Bilinear Map (2007)
Rana Barua, Ratna Dutta, Palash Sarkar
We present an unauthenticated as well as an authenticated multi party key agreement protocol. The unauthenticated version of our protocol uses ternary trees and is based on bilinear maps and...
\All-One " Blocks in a Binary String (2007)
We study the distribution of \all-one " blocks in a binary string. More specically, we compute the expected number of all-one blocks and the expected length of an all-one block in a randomly...
Borel hierarchies in infinite products of Polish spaces (2007)
Let H be a product of countably infinite number of copies of an uncountable Polish space X. Let $\Sigma_\xi$ $(\bar {\Sigma}_\xi)$ be the class of Borel sets of additive class \xi for the product of...
Dynamic Group Key Agreement in Tree-based Setting (2005)
We present a provably secure tree based authenticated group key agreement protocol in dynamic scenario. Bilinear pairing and multi-signature are at the heart of our protocol. We prove that our...
Overview of Key Agreement Protocols (2005)
The emphasis of this paper is to focus on key agreement. To this aim, we address a selfcontained, up-to-date presentation of key agreement protocols at high level. We have attempted to provide a...
Abstract Password-Based Encrypted Group Key Agreement (2005)
This paper presents an efficient password-based authenticated encrypted group key agreement protocol immune to dictionary attack under the computation Diffie-Hellman (CDH) assumption. In a...
Constant Round Dynamic Group Key Agreement (2005)
We present a fully symmetric constant round authenticated group key agreement protocol in dynamic scenario. Our proposed scheme achieves forward secrecy and is provably secure under DDH assumption in...
Constant Round Dynamic Group Key Agreement (2005)
Abstract We present a fully symmetric constant round authenticated group key agreement protocol in dynamic scenario. Our proposed scheme achieves forward secrecy and is provably secure under DDH...
Dynamic Group Key Agreement in Tree-based Setting (2005)
Abstract We present a provably secure tree based authenticated group key agreement protocol in dynamic scenario. Bilinear pairing and multi-signature are at the heart of our protocol. We prove that...
Provably Secure Authenticated Tree Based Group Key Agreement Protocol using Pairing (2004)
Rana Barua, Ratna Dutta, Palash Sarkar
We present a provably secure authenticated tree based key agreement protocol. The protocol is obtained by combining Boneh et al.'s aggregate signature with an unauthenticated ternary tree based...
Extending Joux’s protocol to multi party key agreement (2003)
Rana Barua, Ratna Dutta, Palash Sarkar
1 Introduction Key agreement is one of the fundamental cryptographic primitives. This is required in situations where two or more parties want to communicate securely among themselves. The situation...
Binary Arithmetic for DNA Computers (2001)
Rana Barua, Janardan Misra, Rana Barua, Janardan Misra
We propose a (recursive) DNA algorithm for adding two binary numbers which require O(log n) bio-steps using only O(n) different type of DNA strands, where n is the size of the binary string...
Completeness of Neighbourhood Logic (1999)
Barua, Rana, Roy, Suman, Chaochen, Zhou
This paper presents a completeness result for a first-order interval temporal logic, called Neighbourhood Logic (NL) which has two neighbourhood modalities. NL can support the specification of...
Completeness of Neighbourhood Logic (1999)
Barua, Rana, Roy, Suman, Chaochen, Zhou
This paper presents a completeness result for a first-order interval temporal logic, called Neighbourhood Logic (NL) which has two neighbourhood modalities. NL can support the specification of...
Weak Completeness of a Combination of Neighbourhood Logic and Temporal Logic (1998)
Rana Barua, Qiu Zongyan, Zhou Chaochen Z
Various real-time logics have been proposed to reason about real-time systems. Some of these
Rana Barua, Suman Roy, Zhou Chaochen
Abstract. This paper presents a completeness result for a first-order interval temporal logic, called Neighbourhood Logic (NL) which has two neighbourhood modalities. NL can support the specification...
Neighbourhood Logics: NL and NL² (1997)
In 1996, Zhou Chaochen and Michael Hansen proposed a first order interval logic called Neighbourhood Logic (NL) which can specify liveness and fairness of computing systems and also define notions of...
A characterization and some properties of the Banzhaf-Coleman-Dubey-Shapley sensitivity index
Barua, Rana, Chakravarty, Satya R., Roy, Sonali, Sarka, Palash
A sensitivity index quantifies the degree of smoothness with which it responds to fluctuations in the wishes of the members of a voting body. This paper characterizes the...
A new characterization of the Banzhaf index of power
Barua, Rana, Chakravarty, Satya R., Roy, Sonali
This paper develops a new axiomatic characterization of the Banzhaf index of power using four axioms from four different contributions to the area. A nice feature of the characterization is...
Measuring Power in Weighted Majority Games
Barua, Rana, Chakravarty, Satya R., Roy, Sonali
This paper suggests an indicator of power in weighted majority games. An indicator of power determines the ability of a voter to influence the outcomes of the voting bodies he belongs to. In a...
On the Coleman indices of voting power
Barua, Rana, Chakravarty, Satya R., Roy, Sonali
Coleman [1971. Control of collectives and the power of a collectivity to act. In: Lieberman, B. (Ed.), Social Choice. Gordon and Breach, New York, pp. 269–298] suggested two indices of voting...
A characterization and some properties of the Banzhaf-Coleman-Dubey-Shapley sensitivity index
Barua, Rana, Chakravarty, Satya R., Roy, Sonali, Sarkar, Palash
A NEW CHARACTERIZATION OF THE BANZHAF INDEX OF POWER
RANA BARUA, SATYA R. CHAKRAVARTY, SONALI ROY
This paper develops a new axiomatic characterization of the Banzhaf index of power using four axioms from four different contributions to the area. A nice feature of the characterization is...
A Note on the Carreras-Coleman Decisiveness Index
Barua, Rana, Chakravarty, Satya R., Roy, Sonali
In this paper we establish equivalence between six collections of axioms that all characterize the Carreras-Coleman decisiveness index. Axioms in each of the different sets are shown to be...