Остановите войну!
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
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 25 matches
- 2018
- Takahiro Matsuda, Jacob C. N. Schuldt:
Related Randomness Security for Public Key Encryption, Revisited. Public Key Cryptography (1) 2018: 280-311 - Benedikt Auerbach, Mihir Bellare, Eike Kiltz:
Public-Key Encryption Resistant to Parameter Subversion and Its Realization from Efficiently-Embeddable Groups. Public Key Cryptography (1) 2018: 348-377 - Christian Badertscher, Ueli Maurer, Björn Tackmann:
On Composable Security for Digital Signatures. Public Key Cryptography (1) 2018: 494-523 - Deepesh Data, Manoj Prabhakaran:
Towards Characterizing Securely Computable Two-Party Randomized Functions. Public Key Cryptography (1) 2018: 675-697 - David Derler, Stephan Krenn, Thomas Lorünser, Sebastian Ramacher, Daniel Slamanig, Christoph Striecks:
Revisiting Proxy Re-encryption: Forward Secrecy, Improved Security, and Applications. Public Key Cryptography (1) 2018: 219-250 - Yarkin Doröz, Jeffrey Hoffstein, Jill Pipher, Joseph H. Silverman, Berk Sunar, William Whyte, Zhenfei Zhang:
Fully Homomorphic Encryption from the Finite Field Isomorphism Problem. Public Key Cryptography (1) 2018: 125-155 - Nico Döttling, Sanjam Garg, Mohammad Hajiabadi, Daniel Masny:
New Constructions of Identity-Based and Key-Dependent Message Secure Encryption Schemes. Public Key Cryptography (1) 2018: 3-31 - Tore Kasper Frederiksen, Benny Pinkas, Avishay Yanai:
Committed MPC - Maliciously Secure Multiparty Computation from Homomorphic Commitments. Public Key Cryptography (1) 2018: 587-619 - Georg Fuchsbauer:
Subversion-Zero-Knowledge SNARKs. Public Key Cryptography (1) 2018: 315-347 - Federico Giacon, Felix Heuer, Bertram Poettering:
KEM Combiners. Public Key Cryptography (1) 2018: 190-218 - Federico Giacon, Eike Kiltz, Bertram Poettering:
Hybrid Encryption in a Multi-user Setting, Revisited. Public Key Cryptography (1) 2018: 159-189 - Ariel Hamlin, Abhi Shelat, Mor Weiss, Daniel Wichs:
Multi-Key Searchable Encryption, Revisited. Public Key Cryptography (1) 2018: 95-124 - Daniel Hart, DoHoon Kim, Giacomo Micheli, Guillermo Pascual-Perez, Christophe Petit, Yuxuan Quek:
A Practical Cryptanalysis of WalnutDSA TM. Public Key Cryptography (1) 2018: 381-406 - Gottfried Herold, Elena Kirshanova, Thijs Laarhoven:
Speed-Ups and Time-Memory Trade-Offs for Tuple Lattice Sieving. Public Key Cryptography (1) 2018: 407-436 - Zhengan Huang, Junzuo Lai, Wenbin Chen, Man Ho Au, Zhen Peng, Jin Li:
Hedged Nonce-Based Public-Key Encryption: Adaptive Security Under Randomness Failures. Public Key Cryptography (1) 2018: 253-279 - Yuval Ishai, Manika Mittal, Rafail Ostrovsky:
On the Message Complexity of Secure Multiparty Computation. Public Key Cryptography (1) 2018: 698-711 - Stanislaw Jarecki:
Efficient Covert Two-Party Computation. Public Key Cryptography (1) 2018: 644-674 - Fuyuki Kitagawa, Keisuke Tanaka:
Key Dependent Message Security and Receiver Selective Opening Security for Identity-Based Encryption. Public Key Cryptography (1) 2018: 32-61 - Baiyu Li, Daniele Micciancio:
Equational Security Proofs of Oblivious Transfer Protocols. Public Key Cryptography (1) 2018: 527-553 - Yehuda Lindell, Avishay Yanai:
Fast Garbling of Circuits over 3-Valued Logic. Public Key Cryptography (1) 2018: 620-643 - Lin Lyu, Shengli Liu, Shuai Han, Dawu Gu:
Tightly SIM-SO-CCA Secure Public Key Encryption from Standard Assumptions. Public Key Cryptography (1) 2018: 62-92 - Jeremias Mechler, Jörn Müller-Quade, Tobias Nilges:
Reusing Tamper-Proof Hardware in UC-Secure Protocols. Public Key Cryptography (1) 2018: 463-493 - Peter Scholl:
Extending Oblivious Transfer with Low Communication via Key-Homomorphic PRFs. Public Key Cryptography (1) 2018: 554-583 - Tadanori Teruya, Kenji Kashiwabara, Goichiro Hanaoka:
Fast Lattice Basis Reduction Suitable for Massive Parallelization and Its Application to the Shortest Vector Problem. Public Key Cryptography (1) 2018: 437-460 - Michel Abdalla, Ricardo Dahab:
Public-Key Cryptography - PKC 2018 - 21st IACR International Conference on Practice and Theory of Public-Key Cryptography, Rio de Janeiro, Brazil, March 25-29, 2018, Proceedings, Part I. Lecture Notes in Computer Science 10769, Springer 2018, ISBN 978-3-319-76577-8 [contents]
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-05-08 09:10 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