Pratish Datta

427 total citations
9 papers, 18 citations indexed

About

Pratish Datta is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Computer Vision and Pattern Recognition. According to data from OpenAlex, Pratish Datta has authored 9 papers receiving a total of 18 indexed citations (citations by other indexed papers that have themselves been cited), including 9 papers in Artificial Intelligence, 5 papers in Computational Theory and Mathematics and 3 papers in Computer Vision and Pattern Recognition. Recurrent topics in Pratish Datta's work include Cryptography and Data Security (8 papers), Complexity and Algorithms in Graphs (5 papers) and Cryptographic Implementations and Security (4 papers). Pratish Datta is often cited by papers focused on Cryptography and Data Security (8 papers), Complexity and Algorithms in Graphs (5 papers) and Cryptographic Implementations and Security (4 papers). Pratish Datta collaborates with scholars based in India, Japan and United States. Pratish Datta's co-authors include Ilan Komargodski, Brent Waters, Ratna Dutta, Katsuyuki Takashima, Sourav Mukhopadhyay and Tatsuaki Okamoto and has published in prestigious journals such as Theoretical Computer Science, Algorithmica and Journal of Cryptology.

In The Last Decade

Pratish Datta

5 papers receiving 18 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Pratish Datta India	3	17	9	4	2	2	9	18
Silas Richelson United States	3	27 1.6×	10 1.1×	4 1.0×	4 2.0×	2 1.0×	8	29
Huaxiong Wang Singapore	3	14 0.8×	6 0.7×	3 0.8×	1 0.5×	3 1.5×	3	16
Olesya Razuvayevskaya United Kingdom	3	16 0.9×	6 0.7×	3 0.8×	2 1.0×	1 0.5×	8	35
Anat Paskin-Cherniavsky Israel	3	17 1.0×	7 0.8×	3 0.8×	3 1.5×		8	18
Weiping Song China	2	26 1.5×	7 0.8×	4 1.0×		4 2.0×	3	31
Eduardo Soria-Vázquez United Arab Emirates	2	25 1.5×	13 1.4×	5 1.3×	1 0.5×	1 0.5×	5	29
Hansol Ryu South Korea	2	11 0.6×	5 0.6×	6 1.5×		2 1.0×	3	11
Fernando Virdia United Kingdom	2	25 1.5×	8 0.9×	2 0.5×	3 1.5×	3 1.5×	3	31
Elisabet Golobardes Spain	3	13 0.8×	15 1.7×	5 1.3×	2 1.0×	1 0.5×	9	21
Naomi Benger Australia	2	8 0.5×	8 0.9×	2 0.5×	2 1.0×	3 1.5×	2	11

Countries citing papers authored by Pratish Datta

Since Specialization

Citations

This map shows the geographic impact of Pratish Datta's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Pratish Datta with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Pratish Datta more than expected).

Fields of papers citing papers by Pratish Datta

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Pratish Datta. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Pratish Datta. The network helps show where Pratish Datta may publish in the future.

Co-authorship network of co-authors of Pratish Datta

This figure shows the co-authorship network connecting the top 25 collaborators of Pratish Datta. A scholar is included among the top collaborators of Pratish Datta based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Pratish Datta. Pratish Datta is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

9 of 9 papers shown

1.

Datta, Pratish, Ratna Dutta, & Sourav Mukhopadhyay. (2023). Short attribute-based signatures for arbitrary Turing machines from standard assumptions. Designs Codes and Cryptography. 91(5). 1845–1872.

2.

Datta, Pratish, Ilan Komargodski, & Brent Waters. (2023). Decentralized Multi-authority ABE for $$\textsf{NC}^1$$ from BDH. Journal of Cryptology. 36(2). 10 indexed citations

3.

Datta, Pratish, Tatsuaki Okamoto, & Katsuyuki Takashima. (2020). Efficient Attribute-Based Signatures for Unbounded Arithmetic Branching Programs. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences. E104.A(1). 25–57. 3 indexed citations

4.

Datta, Pratish, Ratna Dutta, & Sourav Mukhopadhyay. (2019). Constrained Pseudorandom Functions for Turing Machines Revisited: How to Achieve Verifiability and Key Delegation. Algorithmica. 81(9). 3245–3390.

5.

Datta, Pratish, Ratna Dutta, & Sourav Mukhopadhyay. (2019). Succinct Predicate and Online-Offline Multi-Input Inner Product Encryptions under Standard Static Assumptions. Journal of Information Security and Applications. 48. 102353–102353.

6.

Datta, Pratish. (2019). Constrained pseudorandom functions from functional encryption. Theoretical Computer Science. 809. 137–170. 1 indexed citations

7.

Datta, Pratish, Ratna Dutta, & Sourav Mukhopadhyay. (2018). Functional Signcryption. Journal of Information Security and Applications. 42. 118–134. 2 indexed citations

8.

Datta, Pratish, Ratna Dutta, & Sourav Mukhopadhyay. (2017). Strongly full-hiding inner product encryption. Theoretical Computer Science. 667. 16–50. 2 indexed citations

9.

Datta, Pratish, et al.. (2014). Algebraic cryptanalysis of stream ciphers using decomposition of Boolean function. Journal of Applied Mathematics and Computing. 49(1-2). 397–417.

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact