Остановите войну!
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 29 matches
- 2019
- Mark Abspoel, Niek J. Bouman, Berry Schoenmakers, Niels de Vreede:
Fast Secure Comparison for Medium-Sized Integers and Its Application in Binarized Neural Networks. CT-RSA 2019: 453-472 - Benedikt Auerbach, Eike Kiltz, Bertram Poettering, Stefan Schoenen:
Lossy Trapdoor Permutations with Improved Lossiness. CT-RSA 2019: 230-250 - Manuel Barbosa, Dario Catalano, Azam Soleimanian, Bogdan Warinschi:
Efficient Function-Hiding Functional Encryption: From Inner-Products to Orthogonality. CT-RSA 2019: 127-148 - Aurélie Bauer, Henri Gilbert, Guénaël Renault, Mélissa Rossi:
Assessment of the Key-Reuse Resilience of NewHope. CT-RSA 2019: 272-292 - Olivier Blazy, Paul Germouty, Duong Hieu Phan:
Downgradable Identity-Based Encryption and Applications. CT-RSA 2019: 44-61 - Estuardo Alpirez Bock, Alessandro Amadori, Joppe W. Bos, Chris Brzuska, Wil Michiels:
Doubly Half-Injective PRGs for Incompressible White-Box Cryptography. CT-RSA 2019: 189-209 - Dan Boneh, Saba Eskandarian, Ben Fisch:
Post-quantum EPID Signatures from Symmetric Primitives. CT-RSA 2019: 251-271 - Sergiu Carpov, Malika Izabachène, Victor Mollimard:
New Techniques for Multi-value Input Homomorphic Evaluation and Applications. CT-RSA 2019: 106-126 - Suvradip Chakraborty, C. Pandu Rangan:
Public Key Encryption Resilient to Post-challenge Leakage and Tampering Attacks. CT-RSA 2019: 23-43 - Sanjit Chatterjee, Sayantan Mukherjee:
Large Universe Subset Predicate Encryption Based on Static Assumption (Without Random Oracle). CT-RSA 2019: 62-82 - Elizabeth C. Crites, Anna Lysyanskaya:
Delegatable Anonymous Credentials from Mercurial Signatures. CT-RSA 2019: 535-555 - Liron David, Avishai Wool:
Poly-Logarithmic Side Channel Rank Estimation via Exponential Sampling. CT-RSA 2019: 330-349 - Antonio Faonio:
Efficient Fully-Leakage Resilient One-More Signature Schemes. CT-RSA 2019: 350-371 - Si Gao, Arnab Roy, Elisabeth Oswald:
Constructing TI-Friendly Substitution Boxes Using Shift-Invariant Permutations. CT-RSA 2019: 433-452 - Rémi Géraud, David Naccache, Razvan Rosie:
Robust Encryption, Extended. CT-RSA 2019: 149-168 - Shai Halevi, Yuriy Polyakov, Victor Shoup:
An Improved RNS Variant of the BFV Homomorphic Encryption Scheme. CT-RSA 2019: 83-105 - Kai Hu, Meiqin Wang:
Automatic Search for a Variant of Division Property Using Three Subsets. CT-RSA 2019: 412-432 - Gembu Ito, Akinori Hosoyamada, Ryutaroh Matsumoto, Yu Sasaki, Tetsu Iwata:
Quantum Chosen-Ciphertext Attacks Against Feistel Ciphers. CT-RSA 2019: 391-411 - Tetsu Iwata, Virginie Lallemand, Gregor Leander, Yu Sasaki:
Universal Forgery and Multiple Forgeries of MergeMAC and Generalized Constructions. CT-RSA 2019: 293-312 - San Ling, Khoa Nguyen, Huaxiong Wang, Yanhong Xu:
Accountable Tracing Signatures from Lattices. CT-RSA 2019: 556-576 - Eleftheria Makri, Dragos Rotaru, Nigel P. Smart, Frederik Vercauteren:
EPIC: Efficient Private Image Classification (or: Learning from the Masters). CT-RSA 2019: 473-492 - Bart Mennink:
Linking Stam's Bounds with Generalized Truncation. CT-RSA 2019: 313-329 - Taiga Mizuide, Atsushi Takayasu, Tsuyoshi Takagi:
Tight Reductions for Diffie-Hellman Variants in the Algebraic Group Model. CT-RSA 2019: 169-188 - Lucas Schabhüser, Denis Butin, Johannes Buchmann:
Context Hiding Multi-key Linearly Homomorphic Authenticators. CT-RSA 2019: 493-513 - Nigel P. Smart, Tim Wood:
Error Detection in Monotone Span Programs with Application to Communication-Efficient Multi-party Computation. CT-RSA 2019: 210-229 - Tao Zhang, Huangting Wu, Sherman S. M. Chow:
Structure-Preserving Certificateless Encryption and Its Application. CT-RSA 2019: 1-22 - Liang Zhao:
Revisiting the Secret Hiding Assumption Used in Verifiable (Outsourced) Computation. CT-RSA 2019: 514-534 - Baoyu Zhu, Xiaoyang Dong, Hongbo Yu:
MILP-Based Differential Attack on Round-Reduced GIFT. CT-RSA 2019: 372-390 - Mitsuru Matsui:
Topics in Cryptology - CT-RSA 2019 - The Cryptographers' Track at the RSA Conference 2019, San Francisco, CA, USA, March 4-8, 2019, Proceedings. Lecture Notes in Computer Science 11405, Springer 2019, ISBN 978-3-030-12611-7 [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-27 15:42 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