Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 53 matches
- 2024
- Pratish Datta, Jiaxin Guan, Alexis Korb, Amit Sahai:
Adaptively Secure Streaming Functional Encryption. IACR Cryptol. ePrint Arch. 2024: 355 (2024) - 2023
- Pratish Datta, Ratna Dutta, Sourav Mukhopadhyay:
Short attribute-based signatures for arbitrary Turing machines from standard assumptions. Des. Codes Cryptogr. 91(5): 1845-1872 (2023) - Pratish Datta, Tapas Pal:
(Compact) Adaptively secure FE for attribute-weighted sums from k-Lin. Des. Codes Cryptogr. 91(9): 2917-3034 (2023) - Pratish Datta, Ilan Komargodski, Brent Waters:
Decentralized Multi-authority ABE for sfNC1 from BDH. J. Cryptol. 36(2): 6 (2023) - Pratish Datta, Ilan Komargodski, Brent Waters:
Fully Adaptive Decentralized Multi-Authority ABE. EUROCRYPT (3) 2023: 447-478 - Pratish Datta, Tapas Pal:
Decentralized Multi-Authority Attribute-Based Inner-Product FE: Large Universe and Unbounded. Public Key Cryptography (1) 2023: 587-621 - Pratish Datta, Tapas Pal:
Registration-Based Functional Encryption. IACR Cryptol. ePrint Arch. 2023: 457 (2023) - Pratish Datta, Tapas Pal:
Decentralized Multi-Authority Attribute-Based Inner-Product FE: Large Universe and Unbounded. IACR Cryptol. ePrint Arch. 2023: 565 (2023) - 2022
- Pratish Datta, Tapas Pal, Katsuyuki Takashima:
Compact FE for Unbounded Attribute-Weighted Sums for Logspace from SXDH. ASIACRYPT (1) 2022: 126-159 - Pratish Datta, Ilan Komargodski, Brent Waters:
Fully Adaptive Decentralized Multi-Authority ABE. IACR Cryptol. ePrint Arch. 2022: 1311 (2022) - Pratish Datta, Tapas Pal, Katsuyuki Takashima:
Compact FE for Unbounded Attribute-Weighted Sums for Logspace from SXDH. IACR Cryptol. ePrint Arch. 2022: 1594 (2022) - 2021
- Pratish Datta, Tatsuaki Okamoto, Katsuyuki Takashima:
Efficient Attribute-Based Signatures for Unbounded Arithmetic Branching Programs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 104-A(1): 25-57 (2021) - Pratish Datta, Tapas Pal:
(Compact) Adaptively Secure FE for Attribute-Weighted Sums from k-Lin. ASIACRYPT (4) 2021: 434-467 - Pratish Datta, Ilan Komargodski, Brent Waters:
Decentralized Multi-authority ABE for DNFs from LWE. EUROCRYPT (1) 2021: 177-209 - Pratish Datta, Ilan Komargodski, Brent Waters:
Decentralized Multi-Authority ABE for NC1 from Computational-BDH. IACR Cryptol. ePrint Arch. 2021: 1325 (2021) - Pratish Datta, Tapas Pal:
(Compact) Adaptively Secure FE for Attribute-Weighted Sums from k-Lin. IACR Cryptol. ePrint Arch. 2021: 1305 (2021) - 2020
- Pratish Datta, Tatsuaki Okamoto, Katsuyuki Takashima:
Adaptively Simulation-Secure Attribute-Hiding Predicate Encryption. IEICE Trans. Inf. Syst. 103-D(7): 1556-1597 (2020) - Pratish Datta:
Constrained pseudorandom functions from functional encryption. Theor. Comput. Sci. 809: 137-170 (2020) - Pratish Datta, Ilan Komargodski, Brent Waters:
Decentralized Multi-Authority ABE for DNFs from LWE. IACR Cryptol. ePrint Arch. 2020: 1386 (2020) - 2019
- Pratish Datta, Ratna Dutta, Sourav Mukhopadhyay:
Constrained Pseudorandom Functions for Turing Machines Revisited: How to Achieve Verifiability and Key Delegation. Algorithmica 81(9): 3245-3390 (2019) - Pratish Datta, Ratna Dutta, Sourav Mukhopadhyay:
Succinct Predicate and Online-Offline Multi-Input Inner Product Encryptions under Standard Static Assumptions. J. Inf. Secur. Appl. 48 (2019) - Pratish Datta, Tatsuaki Okamoto, Katsuyuki Takashima:
Efficient Attribute-Based Signatures for Unbounded Arithmetic Branching Programs. Public Key Cryptography (1) 2019: 127-158 - Pratish Datta, Tatsuaki Okamoto, Katsuyuki Takashima:
Efficient Attribute-Based Signatures for Unbounded Arithmetic Branching Programs. IACR Cryptol. ePrint Arch. 2019: 363 (2019) - 2018
- Pratish Datta, Ratna Dutta, Sourav Mukhopadhyay:
Functional Signcryption. J. Inf. Secur. Appl. 42: 118-134 (2018) - Pratish Datta, Tatsuaki Okamoto, Katsuyuki Takashima:
Adaptively Simulation-Secure Attribute-Hiding Predicate Encryption. ASIACRYPT (2) 2018: 640-672 - Pratish Datta:
Constrained (Verifiable) Pseudorandom Function from Functional Encryption. ISPEC 2018: 141-159 - Pratish Datta, Tatsuaki Okamoto, Junichi Tomida:
Full-Hiding (Unbounded) Multi-input Inner Product Functional Encryption from the k-Linear Assumption. Public Key Cryptography (2) 2018: 245-277 - Pratish Datta, Tatsuaki Okamoto, Junichi Tomida:
Full-Hiding (Unbounded) Multi-Input Inner Product Functional Encryption from the k-Linear Assumption. IACR Cryptol. ePrint Arch. 2018: 61 (2018) - Pratish Datta, Tatsuaki Okamoto, Katsuyuki Takashima:
Adaptively Simulation-Secure Attribute-Hiding Predicate Encryption. IACR Cryptol. ePrint Arch. 2018: 1093 (2018) - 2017
- Pratish Datta, Ratna Dutta, Sourav Mukhopadhyay:
Strongly full-hiding inner product encryption. Theor. Comput. Sci. 667: 16-50 (2017)
skipping 23 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-06-05 09:56 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint