Pratish Datta

Orcid: 0000-0002-3938-7594

According to our database1, Pratish Datta authored at least 35 papers between 2014 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Compact FE for unbounded attribute-weighted sums for logspace from SXDH.
Des. Codes Cryptogr., October, 2024

Adaptively Secure Streaming Functional Encryption.
IACR Cryptol. ePrint Arch., 2024

2023
(Compact) Adaptively secure FE for attribute-weighted sums from k-Lin.
Des. Codes Cryptogr., September, 2023

Short attribute-based signatures for arbitrary Turing machines from standard assumptions.
Des. Codes Cryptogr., May, 2023

Decentralized Multi-authority ABE for sfNC<sup>1</sup> from BDH.
J. Cryptol., April, 2023

Decentralized Multi-Authority Attribute-Based Inner-Product FE: Large Universe and Unbounded.
IACR Cryptol. ePrint Arch., 2023

Registration-Based Functional Encryption.
IACR Cryptol. ePrint Arch., 2023

2022
Fully Adaptive Decentralized Multi-Authority ABE.
IACR Cryptol. ePrint Arch., 2022

2021
Efficient Attribute-Based Signatures for Unbounded Arithmetic Branching Programs.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2021

Decentralized Multi-Authority ABE for NC^1 from Computational-BDH.
IACR Cryptol. ePrint Arch., 2021

2020
Constrained pseudorandom functions from functional encryption.
Theor. Comput. Sci., 2020

Adaptively Simulation-Secure Attribute-Hiding Predicate Encryption.
IEICE Trans. Inf. Syst., 2020

Decentralized Multi-Authority ABE for DNFs from LWE.
IACR Cryptol. ePrint Arch., 2020

2019
Succinct Predicate and Online-Offline Multi-Input Inner Product Encryptions under Standard Static Assumptions.
J. Inf. Secur. Appl., 2019

Constrained Pseudorandom Functions for Turing Machines Revisited: How to Achieve Verifiability and Key Delegation.
Algorithmica, 2019

2018
Functional Signcryption.
J. Inf. Secur. Appl., 2018

Full-Hiding (Unbounded) Multi-Input Inner Product Functional Encryption from the k-Linear Assumption.
IACR Cryptol. ePrint Arch., 2018

Constrained (Verifiable) Pseudorandom Function from Functional Encryption.
Proceedings of the Information Security Practice and Experience, 2018

2017
Strongly full-hiding inner product encryption.
Theor. Comput. Sci., 2017

Attribute-Based Signatures for Turing Machines.
IACR Cryptol. ePrint Arch., 2017

Constrained Pseudorandom Functions for Unconstrained Inputs Revisited: Achieving Verifiability and Key Delegation.
Proceedings of the Public-Key Cryptography - PKC 2017, 2017

Compact Attribute-Based and Online-Offline Multi-input Inner Product Encryptions from Standard Static Assumptions (Short Paper).
Proceedings of the Information Security Practice and Experience, 2017

2016
Verifiable and Delegatable Constrained Pseudorandom Functions for Unconstrained Inputs.
IACR Cryptol. ePrint Arch., 2016

Adaptively Secure Unrestricted Attribute-Based Encryption with Subset Difference Revocation in Bilinear Groups of Prime Order.
Proceedings of the Progress in Cryptology - AFRICACRYPT 2016, 2016

2015
Functional Encryption for Inner Product with Full Function Privacy.
IACR Cryptol. ePrint Arch., 2015

Compact Attribute-Based Encryption and Signcryption for General Circuits from Multilinear Maps.
IACR Cryptol. ePrint Arch., 2015

Functional Signcryption: Notion, Construction, and Applications.
IACR Cryptol. ePrint Arch., 2015

General Circuit Realizing Compact Revocable Attribute-Based Encryption from Multilinear Maps.
IACR Cryptol. ePrint Arch., 2015

Fully Secure Unbounded Revocable Attribute-Based Encryption in Prime Order Bilinear Groups via Subset Difference Method.
IACR Cryptol. ePrint Arch., 2015

Fully Secure Online/Offline Predicate and Attribute-Based Encryption.
Proceedings of the Information Security Practice and Experience, 2015

2014
A Probabilistic Algebraic Attack on the Grain Family of Stream Cipher.
IACR Cryptol. ePrint Arch., 2014

Fully Secure Self-Updatable Encryption in Prime Order Bilinear Groups.
IACR Cryptol. ePrint Arch., 2014

Universally Composable Efficient Priced Oblivious Transfer from a Flexible Membership Encryption.
IACR Cryptol. ePrint Arch., 2014

A New Variant of Algebraic Attack.
Proceedings of the Recent Trends in Computer Networks and Distributed Systems Security, 2014

A Probabilistic Algebraic Attack on the Grain Family of Stream Ciphers.
Proceedings of the Network and System Security - 8th International Conference, 2014


  Loading...