![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
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
no 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 23 matches
- 2023
- Abtin Afshar, Geoffroy Couteau, Mohammad Mahmoody, Elahe Sadeghi:
Fine-Grained Non-interactive Key-Exchange: Constructions and Lower Bounds. EUROCRYPT (1) 2023: 55-85 - Amit Agarwal, James Bartusek
, Dakshita Khurana, Nishant Kumar:
A New Framework for Quantum Oblivious Transfer. EUROCRYPT (1) 2023: 363-394 - Shweta Agrawal, Fuyuki Kitagawa, Ryo Nishimaki, Shota Yamada, Takashi Yamakawa:
Public Key Encryption with Secure Key Leasing. EUROCRYPT (1) 2023: 581-610 - Léonard Assouline, Brice Minaud:
Weighted Oblivious RAM, with Applications to Searchable Symmetric Encryption. EUROCRYPT (1) 2023: 426-455 - Elette Boyle, Geoffroy Couteau
, Niv Gilboa
, Yuval Ishai, Lisa Kohl, Nicolas Resch
, Peter Scholl
:
Oblivious Transfer with Constant Computational Overhead. EUROCRYPT (1) 2023: 271-302 - Suvradip Chakraborty, Chaya Ganesh, Pratik Sarkar:
Reverse Firewalls for Oblivious Transfer Extension and Applications to Zero-Knowledge. EUROCRYPT (1) 2023: 239-270 - Kai-Min Chung, Yao-Ting Lin, Mohammad Mahmoody:
Black-Box Separations for Non-interactive Classical Commitments in a Quantum World. EUROCRYPT (1) 2023: 144-172 - Yevgeniy Dodis, Willy Quach, Daniel Wichs:
Speak Much, Remember Little: Cryptography in the Bounded Storage Model, Revisited. EUROCRYPT (1) 2023: 86-116 - Nils Fleischhacker
, Kasper Green Larsen
, Mark Simkin
:
How to Compress Encrypted Data. EUROCRYPT (1) 2023: 551-577 - Rachit Garg, Dakshita Khurana, George Lu, Brent Waters:
On Non-uniform Security for Black-Box Non-interactive CCA Commitments. EUROCRYPT (1) 2023: 173-204 - Xiaojie Guo
, Kang Yang
, Xiao Wang
, Wenhao Zhang
, Xiang Xie
, Jiang Zhang
, Zheli Liu
:
Half-Tree: Halving the Cost of Tree Expansion in COT and DPF. EUROCRYPT (1) 2023: 330-362 - Minki Hhan, Tomoyuki Morimae, Takashi Yamakawa:
From the Hardness of Detecting Superpositions to Cryptography: Quantum Public Key Encryption and Commitments. EUROCRYPT (1) 2023: 639-667 - Aayush Jain, Huijia Lin, Paul Lou, Amit Sahai:
Polynomial-Time Cryptanalysis of the Subspace Flooding Assumption for Post-quantum i풪. EUROCRYPT (1) 2023: 205-235 - Qipeng Liu
:
Non-uniformity and Quantum Advice in the Quantum Random Oracle Model. EUROCRYPT (1) 2023: 117-143 - Jiahui Liu
, Hart Montgomery
, Mark Zhandry
:
Another Round of Breaking and Making Quantum Money: - How to Not Build It from Lattices, and More. EUROCRYPT (1) 2023: 611-638 - Andrew Park, Wei-Kai Lin
, Elaine Shi:
NanoGRAM: Garbled RAM with $\widetilde{O}(\log N)$ Overhead. EUROCRYPT (1) 2023: 456-486 - Giuseppe Persiano
, Kevin Yeo:
Lower Bound Framework for Differentially Private and Oblivious Data Structures. EUROCRYPT (1) 2023: 487-517 - Guy N. Rothblum
:
Indistinguishable Predictions and Multi-group Fair Learning. EUROCRYPT (1) 2023: 3-21 - Akin Ünal
:
Worst-Case Subexponential Attacks on PRGs of Constant Degree or Constant Locality. EUROCRYPT (1) 2023: 25-54 - Kevin Yeo:
Lower Bounds for (Batch) PIR with Private Preprocessing. EUROCRYPT (1) 2023: 518-550 - Mingxun Zhou, Wei-Kai Lin, Yiannis Tselekounis, Elaine Shi:
Optimal Single-Server Private Information Retrieval. EUROCRYPT (1) 2023: 395-425 - Zhelei Zhou, Bingsheng Zhang, Hong-Sheng Zhou
, Kui Ren:
Endemic Oblivious Transfer via Random Oracles, Revisited. EUROCRYPT (1) 2023: 303-329 - Carmit Hazay
, Martijn Stam
:
Advances in Cryptology - EUROCRYPT 2023 - 42nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Lyon, France, April 23-27, 2023, Proceedings, Part I. Lecture Notes in Computer Science 14004, Springer 2023, ISBN 978-3-031-30544-3 [contents]
loading more results
failed to load more results, please try again later
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-08-24 05:54 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