Остановите войну!
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 28 matches
- 2008
- Joonsang Baek, David Galindo, Willy Susilo, Jianying Zhou:
Constructing Strong KEM from Weak KEM (or How to Revive the KEM/DEM Framework). SCN 2008: 358-374 - Ali Bagherzandi, Stanislaw Jarecki:
Multisignatures Using Proofs of Secret Key Possession, as Secure as the Diffie-Hellman Problem. SCN 2008: 218-235 - Marco Baldi, Marco Bodrato, Franco Chiaraluce:
A New Analysis of the McEliece Cryptosystem Based on QC-LDPC Codes. SCN 2008: 246-262 - Amos Beimel, Anat Paskin:
On Linear Secret Sharing for Connectivity in Directed Graphs. SCN 2008: 172-184 - Xavier Boyen, Cécile Delerablée:
Expressive Subgroup Signatures. SCN 2008: 185-200 - Julien Bringer, Hervé Chabanne, Thomas Icart:
Improved Privacy of the Tree-Based Hash Protocols Using Physically Unclonable Function. SCN 2008: 77-91 - Guilhem Castagnos:
Two Generic Constructions of Probabilistic Cryptosystems and Their Applications. SCN 2008: 92-108 - Benoît Chevallier-Mames, David Naccache, Jacques Stern:
Linear Bandwidth Naccache-Stern Encryption. SCN 2008: 327-339 - Sherman S. M. Chow, Volker Roth, Eleanor Gilbert Rieffel:
General Certificateless Encryption and Timed-Release Encryption. SCN 2008: 126-143 - Jean-Sébastien Coron:
A New DPA Countermeasure Based on Permutation Tables. SCN 2008: 278-292 - Georg Fuchsbauer, David Pointcheval:
Anonymous Proxy Signatures. SCN 2008: 201-217 - Jun Furukawa, Frederik Armknecht, Kaoru Kurosawa:
A Universally Composable Group Key Exchange Protocol with Minimum Communication Effort. SCN 2008: 392-408 - Shai Halevi:
Storage Encryption: A Cryptographer's View. SCN 2008: 1 - Malika Izabachène, David Pointcheval:
New Anonymity Notions for Identity-Based Encryption. SCN 2008: 375-391 - Yves Igor Jerschow, Christian Lochert, Björn Scheuermann, Martin Mauve:
CLL: A Cryptographic Link Layer for Local Area Networks. SCN 2008: 21-38 - Bhavana Kanukurthi, Leonid Reyzin:
An Improved Robust Fuzzy Extractor. SCN 2008: 156-171 - Aggelos Kiayias, Shouhuai Xu, Moti Yung:
Privacy Preserving Data Mining within Anonymous Credential Systems. SCN 2008: 57-76 - Yehuda Lindell, Benny Pinkas, Nigel P. Smart:
Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries. SCN 2008: 2-20 - Joseph K. Liu, Jianying Zhou:
Efficient Certificate-Based Encryption in the Standard Model. SCN 2008: 144-155 - Bodo Möller, Andy Rupp:
Faster Multi-exponentiation through Caching: Accelerating (EC)DSA Signature Verification. SCN 2008: 39-56 - Svetla Nikova, Vincent Rijmen, Martin Schläffer:
Using Normal Bases for Compact Hardware Implementations of the AES S-Box. SCN 2008: 236-245 - Kenneth G. Paterson, Gaven J. Watson:
Immunising CBC Mode Against Padding Oracle Attacks: A Formal Security Treatment. SCN 2008: 340-357 - Arpita Patra, Ashish Choudhary, C. Pandu Rangan:
Unconditionally Reliable and Secure Message Transmission in Directed Networks Revisited. SCN 2008: 309-326 - Christophe Petit, Kristin E. Lauter, Jean-Jacques Quisquater:
Full Cryptanalysis of LPS and Morgenstern Hash Functions. SCN 2008: 263-277 - Christian Schridde, Matthew Smith, Bernd Freisleben:
An Identity-Based Key Agreement Protocol for the Network Layer. SCN 2008: 409-422 - Isamu Teranishi, Wakaha Ogata:
Cramer-Shoup Satisfies a Stronger Plaintext Awareness under a Weaker Assumption. SCN 2008: 109-125 - Douglas Wikström:
Simplified Submission of Inputs to Protocols. SCN 2008: 293-308 - Rafail Ostrovsky, Roberto De Prisco, Ivan Visconti:
Security and Cryptography for Networks, 6th International Conference, SCN 2008, Amalfi, Italy, September 10-12, 2008. Proceedings. Lecture Notes in Computer Science 5229, Springer 2008, ISBN 978-3-540-85854-6 [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-06 02:16 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