Остановите войну!
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 35 matches
- 2008
- Manuel Barbosa, Thierry Brouard, Stéphane Cauchie, Simão Melo de Sousa:
Secure Biometric Authentication with Improved Accuracy. ACISP 2008: 21-36 - Olivier Billet, Matthew J. B. Robshaw, Yannick Seurin, Yiqun Lisa Yin:
Looking Back at a New Hash Function. ACISP 2008: 239-253 - Colin Boyd, Yvonne Cliff, Juan Manuel González Nieto, Kenneth G. Paterson:
Efficient One-Round Key Exchange in the Standard Model. ACISP 2008: 69-83 - Xavier Boyen:
New Paradigms for Password Security. ACISP 2008: 1-5 - Jacek Cichon, Marek Klonowski, Miroslaw Kutylowski:
Distributed Verification of Mixing - Local Forking Proofs Model. ACISP 2008: 128-140 - Debra L. Cook, Moti Yung, Angelos D. Keromytis:
Methods for Linear and Differential Cryptanalysis of Elastic Block Ciphers. ACISP 2008: 187-202 - Christophe Doche, Laurent Habsieger:
A Tree-Based Approach for Computing Double-Base Chains. ACISP 2008: 433-446 - Reza Rezaeian Farashahi:
Extractors for Jacobians of Binary Genus-2 Hyperelliptic Curves. ACISP 2008: 447-462 - Sebastian Gajek, Mark Manulis, Jörg Schwenk:
Enforcing User-Aware Browser-Based Mutual Authentication with Strong Locked Same Origin Policy. ACISP 2008: 6-20 - Risto M. Hakala, Kaisa Nyberg:
Linear Distinguishing Attack on Shannon. ACISP 2008: 297-305 - Miia Hermelin, Joo Yeon Cho, Kaisa Nyberg:
Multidimensional Linear Cryptanalysis of Reduced Round Serpent. ACISP 2008: 203-215 - Takato Hirano, Koichiro Wada, Keisuke Tanaka:
Public-Key Cryptosystems with Primitive Power Roots of Unity. ACISP 2008: 98-112 - Sunghyun Kim, Heejo Lee:
Reducing Payload Scans for Attack Signature Matching Using Rule Classification. ACISP 2008: 350-360 - Pankaj Kohli, Bezawada Bruhadeshwar:
FormatShield: A Binary Rewriting Defense against Format String Attacks. ACISP 2008: 376-390 - Yuseop Lee, Kitae Jeong, Jaechul Sung, Seokhie Hong:
Related-Key Chosen IV Attacks on Grain-v1 and Grain-128. ACISP 2008: 321-335 - Min Li, Hua Wang, Ashley W. Plank, Jianming Yong:
Advanced Permission-Role Relationship in Role-Based Access Control. ACISP 2008: 391-403 - Subhamoy Maitra, Goutam Paul:
Recovering RC4 Permutation from 2048 Keystream Bytes if jIs Stuck. ACISP 2008: 306-320 - Silvana Medos, Serdar Boztas:
Montgomery Residue Representation Fault-Tolerant Computation in GF(2k). ACISP 2008: 419-432 - Florian Mendel, Martin Schläffer:
Collisions for Round-Reduced LAKE. ACISP 2008: 267-281 - Alfred Menezes, Berkant Ustaoglu:
Comparing the Pre- and Post-specified Peer Models for Key Agreement. ACISP 2008: 53-68 - Christophe Nègre, Thomas Plantard:
Efficient Modular Arithmetic in Adapted Modular Number System Using Lagrange Representation. ACISP 2008: 463-477 - B. John Oommen, Ebaa Fayyoumi:
Enhancing Micro-Aggregation Technique by Utilizing Dependence-Based Information in Secure Statistical Databases. ACISP 2008: 404-418 - Arpita Patra, Ashish Choudhary, Madhu Vaidyanathan, C. Pandu Rangan:
Efficient Perfectly Reliable and Secure Message Transmission Tolerating Mobile Adversary. ACISP 2008: 170-186 - Somitra Kumar Sanadhya, Palash Sarkar:
Non-linear Reduced Round Attacks against SHA-2 Hash Family. ACISP 2008: 254-266 - Yu Sasaki, Kazumaro Aoki:
Preimage Attacks on Step-Reduced MD5. ACISP 2008: 282-296 - V. Sai Sathyanarayan, Pankaj Kohli, Bezawada Bruhadeshwar:
Signature Generation and Detection of Malware Families. ACISP 2008: 336-349 - Jiayuan Sui, Douglas R. Stinson:
A Critical Analysis and Improvement of AACS Drive-Host Authentication. ACISP 2008: 37-52 - Hung-Min Sun, Mu-En Wu, Huaxiong Wang, Jian Guo:
On the Improvement of the BDF Attack on LSBS-RSA. ACISP 2008: 84-97 - Isamu Teranishi, Wakaha Ogata:
Relationship between Two Approaches for Defining the Standard Model PA-ness. ACISP 2008: 113-127 - Peng Wang, Dengguo Feng, Wenling Wu, Liting Zhang:
On the Unprovable Security of 2-Key XCBC. ACISP 2008: 230-238
skipping 5 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-05-16 21:24 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