default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRana Barua
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[c18]Rana Barua, Kishan Chand Gupta, Sumit Kumar Pandey, Indranil Ghosh Ray:
On Diffusion Layers of SPN Based Format Preserving Encryption Schemes: Format Preserving Sets Revisited. INDOCRYPT 2018: 91-104- 2016
- [j17]Tapas Pandit, Sumit Kumar Pandey, Rana Barua:
Attribute-Based Signcryption: Signer Privacy, Strong Unforgeability and IND-CCA Security in Adaptive-Predicates Model (Extended Version). J. Internet Serv. Inf. Secur. 6(3): 61-113 (2016) - 2015
- [i9]Tapas Pandit, Sumit Kumar Pandey, Rana Barua:
Attribute-Based Signcryption : Signer Privacy, Strong Unforgeability and IND-CCA2 Security in Adaptive-Predicates Attack. IACR Cryptol. ePrint Arch. 2015: 555 (2015) - 2014
- [j16]Tapas Pandit, Rana Barua, Somanath Tripathy:
eCK Secure Single Round ID-based Authenticated Key Exchange Protocols with Master Perfect Forward Secrecy (Extended Version). J. Wirel. Mob. Networks Ubiquitous Comput. Dependable Appl. 5(4): 65-85 (2014) - [c17]Tapas Pandit, Rana Barua, Somanath Tripathy:
eCK Secure Single Round ID-Based Authenticated Key Exchange Protocols with Master Perfect Forward Secrecy. NSS 2014: 435-447 - [c16]Tapas Pandit, Sumit Kumar Pandey
, Rana Barua:
Attribute-Based Signcryption : Signer Privacy, Strong Unforgeability and IND-CCA2 Security in Adaptive-Predicates Attack. ProvSec 2014: 274-290 - [i8]Tapas Pandit, Rana Barua:
Adaptively Secure Functional Encryption for Finite Languages from DLIN Assumption. IACR Cryptol. ePrint Arch. 2014: 225 (2014) - 2012
- [c15]Tapas Pandit, Rana Barua:
Efficient Fully Secure Attribute-Based Encryption Schemes for General Access Structures. ProvSec 2012: 193-214 - [r1]Rana Barua, Kishan Chand Gupta:
Finite Automata. Handbook of Finite State Based Models and Applications 2012: 1-17 - 2011
- [j15]Sumit Kumar Pandey, Rana Barua:
Efficient Construction of Identity Based Signcryption Schemes from Identity Based Encryption and Signature Schemes. J. Internet Serv. Inf. Secur. 1(2/3): 161-180 (2011) - 2010
- [c14]Sumit Kumar Pandey, Rana Barua:
Construction of Identity Based Signcryption Schemes. WISA 2010: 1-14
2000 – 2009
- 2009
- [j14]Rana Barua, Satya R. Chakravarty, Sonali Roy:
A Note on the Carreras-Coleman decisiveness Index. IGTR 11(2): 237-245 (2009) - [j13]Rana Barua, Satya R. Chakravarty, Palash Sarkar:
Minimal-axiom characterizations of the Coleman and Banzhaf indices of voting power. Math. Soc. Sci. 58(3): 367-375 (2009) - [c13]Mahabir Prasad Jhanwar, Rana Barua:
Sampling from Signed Quadratic Residues: RSA Group Is Pseudofree. INDOCRYPT 2009: 233-247 - 2008
- [j12]Ratna Dutta, Rana Barua:
Provably Secure Constant Round Contributory Group Key Agreement in Dynamic Setting. IEEE Trans. Inf. Theory 54(5): 2007-2025 (2008) - [c12]Mahabir Prasad Jhanwar, Rana Barua:
A Variant of Boneh-Gentry-Hamburg's Pairing-Free Identity Based Encryption Scheme. Inscrypt 2008: 314-331 - [i7]Mahabir Prasad Jhanwar, Rana Barua:
A Public Key Encryption In Standard Model Using Cramer-Shoup Paradigm. IACR Cryptol. ePrint Arch. 2008: 88 (2008) - 2007
- [c11]Rana Barua, Sumit Kumar Pandey, Ravi Pankaj:
Efficient Window-Based Scalar Multiplication on Elliptic Curves Using Double-Base Number System. INDOCRYPT 2007: 351-360 - 2006
- [j11]Rana Barua, Satya R. Chakravarty, Sonali Roy:
On the Coleman indices of voting power. Eur. J. Oper. Res. 171(1): 273-289 (2006) - [j10]Ratna Dutta, Rana Barua:
Password-based Encrypted Group Key Agreement. Int. J. Netw. Secur. 3(1): 23-34 (2006) - [e1]Rana Barua, Tanja Lange:
Progress in Cryptology - INDOCRYPT 2006, 7th International Conference on Cryptology in India, Kolkata, India, December 11-13, 2006, Proceedings. Lecture Notes in Computer Science 4329, Springer 2006, ISBN 3-540-49767-6 [contents] - 2005
- [j9]Rana Barua, Satya R. Chakravarty, Sonali Roy:
A New Characterization of the Banzhaf Index of Power. IGTR 7(4): 545-553 (2005) - [c10]Ratna Dutta, Rana Barua:
Dynamic Group Key Agreement in Tree-Based Setting. ACISP 2005: 101-112 - [c9]Ratna Dutta, Rana Barua:
Constant Round Dynamic Group Key Agreement. ISC 2005: 74-88 - [i6]Ratna Dutta, Rana Barua:
Dynamic Group Key Agreement in Tree-Based Setting. IACR Cryptol. ePrint Arch. 2005: 131 (2005) - [i5]Ratna Dutta, Rana Barua:
Constant Round Dynamic Group Key Agreement. IACR Cryptol. ePrint Arch. 2005: 221 (2005) - [i4]Ratna Dutta, Rana Barua:
Overview of Key Agreement Protocols. IACR Cryptol. ePrint Arch. 2005: 289 (2005) - 2004
- [j8]Rana Barua:
Completeness of a combination of neighbourhood logic and temporal logic. Formal Aspects Comput. 16(2): 96-103 (2004) - [j7]Rana Barua, Satya R. Chakravarty, Sonali Roy, Palash Sarkar:
A characterization and some properties of the Banzhaf-Coleman-Dubey-Shapley sensitivity index. Games Econ. Behav. 49(1): 31-48 (2004) - [c8]Palash Sarkar, Pradeep Kumar Mishra, Rana Barua:
New Table Look-Up Methods for Faster Frobenius Map Based Scalar Multiplication Over GF(pn). ACNS 2004: 479-493 - [c7]Ratna Dutta, Rana Barua, Palash Sarkar:
Provably Secure Authenticated Tree Based Group Key Agreement. ICICS 2004: 92-104 - [c6]Sanjit Chatterjee, Palash Sarkar, Rana Barua:
Efficient Computation of Tate Pairing in Projective Coordinate over General Characteristic Fields. ICISC 2004: 168-181 - [i3]Ratna Dutta, Rana Barua, Palash Sarkar:
Pairing-Based Cryptographic Protocols : A Survey. IACR Cryptol. ePrint Arch. 2004: 64 (2004) - [i2]Ratna Dutta, Rana Barua, Palash Sarkar:
Provably Secure Authenticated Tree Based Group Key Agreement Protocol. IACR Cryptol. ePrint Arch. 2004: 90 (2004) - 2003
- [c5]Rana Barua, Shantanu Das:
Finite field arithmetic using self-assembly of DNA tilings. IEEE Congress on Evolutionary Computation 2003: 2529-2536 - [c4]Rana Barua, Ratna Dutta, Palash Sarkar:
Extending Joux's Protocol to Multi Party Key Agreement (Extended Abstract). INDOCRYPT 2003: 205-217 - [i1]Rana Barua, Ratna Dutta, Palash Sarkar:
Extending Joux's Protocol to Multi Party Key Agreement. IACR Cryptol. ePrint Arch. 2003: 62 (2003) - 2002
- [c3]Rana Barua, Janardan Misra:
Binary Arithmetic for DNA Computers. DNA 2002: 124-132 - 2000
- [j6]Rana Barua, Suman Roy, Chaochen Zhou:
Completeness of neighbourhood logic. J. Log. Comput. 10(2): 271-295 (2000)
1990 – 1999
- 1999
- [c2]Rana Barua, Suman Roy, Zhou Chaochen:
Completeness of Neighbourhood Logic. STACS 1999: 521-530 - 1998
- [j5]Palash Sarkar, Rana Barua:
The Set of Reversible 90/150 Cellular Automata Is Regular. Discret. Appl. Math. 84(1-3): 199-213 (1998) - [j4]Palash Sarkar, Rana Barua:
Multidimenstional Sigma-Automata, Pi-Polynomials and Generalised S-Matrices. Theor. Comput. Sci. 197(1-2): 111-138 (1998) - 1997
- [c1]Rana Barua, Samik Sengupta:
Architectures for Arithmetic over GF(2m). VLSI Design 1997: 465-469 - 1996
- [j3]Rana Barua, S. Ramakrishnan:
sigma-Game, sigma+-Game, and Two-Dimensional Additive Cellular Automata. Theor. Comput. Sci. 154(2): 349-366 (1996) - 1992
- [j2]Rana Barua:
The Hausdorff-Kuratowski Hierarchy of omega-Regular Languages and a Hierarchy of Muller Automata. Theor. Comput. Sci. 96(2): 345-360 (1992) - 1991
- [j1]Rana Barua:
On generalized automata. Fundam. Informaticae 14(3): 313-322 (1991)
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-04-24 23:11 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:
