Pratish Datta

From MaRDI portal
(Redirected from Person:500002)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Compact \textsf{FE} for unbounded attribute-weighted sums for logspace from \textsf{SXDH}
Designs, Codes and Cryptography
2024-10-14Paper
Fully adaptive decentralized multi-authority \textsf{ABE}
Advances in Cryptology – EUROCRYPT 2023
2023-12-12Paper
Decentralized multi-authority attribute-based inner-product FE: large universe and unbounded
Lecture Notes in Computer Science
2023-11-24Paper
(Compact) adaptively secure FE for attribute-weighted sums from \(k\)-lin
Designs, Codes and Cryptography
2023-09-07Paper
Compact FE for unbounded attribute-weighted sums for logspace from SXDH
Advances in Cryptology – ASIACRYPT 2022
2023-08-25Paper
Constrained (Verifiable) Pseudorandom Function from Functional Encryption
Information Security Practice and Experience
2023-06-30Paper
(Compact) Adaptively Secure FE for Attribute-Weighted Sums from k-Lin
Lecture Notes in Computer Science
2023-05-26Paper
Short attribute-based signatures for arbitrary Turing machines from standard assumptions
Designs, Codes and Cryptography
2023-04-28Paper
Decentralized multi-authority ABE for \(\mathsf{NC}^1\) from BDH
Journal of Cryptology
2023-04-13Paper
Compact Attribute-Based and Online-Offline Multi-input Inner Product Encryptions from Standard Static Assumptions (Short Paper)
Information Security Practice and Experience
2022-12-09Paper
Decentralized multi-authority \textbf{\textsf{ABE}} for \textbf{\textsf{DNF}}s from \textbf{\textsf{LWE}}2021-12-08Paper
Constrained pseudorandom functions from functional encryption
Theoretical Computer Science
2020-01-29Paper
Efficient attribute-based signatures for unbounded arithmetic branching programs2020-01-28Paper
Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation
Algorithmica
2019-08-20Paper
Adaptively simulation-secure attribute-hiding predicate encryption2019-01-23Paper
Fully secure online/offline predicate and attribute-based encryption2018-12-07Paper
General circuit realizing compact revocable attribute-based encryption from multilinear maps2018-10-18Paper
Full-hiding (unbounded) multi-input inner product functional encryption from the \(k\)-linear assumption2018-05-29Paper
Constrained pseudorandom functions for unconstrained inputs revisited: achieving verifiability and key delegation
Lecture Notes in Computer Science
2017-06-13Paper
Strongly full-hiding inner product encryption
Theoretical Computer Science
2017-02-22Paper
Adaptively Secure Unrestricted Attribute-Based Encryption with Subset Difference Revocation in Bilinear Groups of Prime Order
Progress in Cryptology – AFRICACRYPT 2016
2016-06-22Paper
Functional encryption for inner product with full function privacy
Public-Key Cryptography – PKC 2016
2016-04-13Paper
Functional signcryption: notion, construction, and applications
Provable Security
2016-01-27Paper
Compact Attribute-Based Encryption and Signcryption for General Circuits from Multilinear Maps
Progress in Cryptology -- INDOCRYPT 2015
2016-01-12Paper
Fully secure self-updatable encryption in prime order bilinear groups
Lecture Notes in Computer Science
2015-11-03Paper
Algebraic cryptanalysis of stream ciphers using decomposition of Boolean function
Journal of Applied Mathematics and Computing
2015-10-07Paper
Universally composable efficient priced oblivious transfer from a flexible membership encryption
Information Security and Privacy
2014-07-24Paper


Research outcomes over time


This page was built for person: Pratish Datta