Остановите войну!
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 638 matches
- 2009
- Masayuki Abe, Miyako Ohkubo:
A Framework for Universally Composable Non-Committing Blind Signatures. IACR Cryptol. ePrint Arch. 2009: 494 (2009) - Reynald Affeldt, David Nowak, Kiyoshi Yamada:
Certifying Assembly with Formal Cryptographic Proofs: the Case of BBS. IACR Cryptol. ePrint Arch. 2009: 322 (2009) - Omran Ahmadi, Francisco Rodríguez-Henríquez:
Low Complexity Cubing and Cube Root Computation over F3m in Polynomial Basis. IACR Cryptol. ePrint Arch. 2009: 70 (2009) - Laila El Aimani:
Toward a Generic Construction of Convertible Undeniable Signatures from Pairing-Based Signatures. IACR Cryptol. ePrint Arch. 2009: 362 (2009) - Laila El Aimani:
On Generic Constructions of Designated Confirmer Signatures (The "Encryption of a Signature" Paradigm Revisited). IACR Cryptol. ePrint Arch. 2009: 403 (2009) - Laila El Aimani:
Efficient Confirmer Signatures from the "Signature of a Commitment" Paradigm. IACR Cryptol. ePrint Arch. 2009: 435 (2009) - Alawi A. Al-saggaf, H. S. Acharya:
A GENERALIZED FRAMEWORK FOR CRISP COMMITMENT SCHEMES. IACR Cryptol. ePrint Arch. 2009: 202 (2009) - Martin R. Albrecht, Craig Gentry, Shai Halevi, Jonathan Katz:
Attacking Cryptographic Schemes Based on "Perturbation Polynomials". IACR Cryptol. ePrint Arch. 2009: 98 (2009) - Joël Alwen, Yevgeniy Dodis, Moni Naor, Gil Segev, Shabsi Walfish, Daniel Wichs:
Public-Key Encryption in the Bounded-Retrieval Model. IACR Cryptol. ePrint Arch. 2009: 512 (2009) - Joël Alwen, Yevgeniy Dodis, Daniel Wichs:
Leakage-Resilient Public-Key Cryptography in the Bounded-Retrieval Model. IACR Cryptol. ePrint Arch. 2009: 160 (2009) - Christophe Arene, Tanja Lange, Michael Naehrig, Christophe Ritzenthaler:
Faster Computation of the Tate Pairing. IACR Cryptol. ePrint Arch. 2009: 155 (2009) - Seiko Arita:
An Efficient Adaptive-Deniable-Concurrent Non-malleable Commitment Scheme. IACR Cryptol. ePrint Arch. 2009: 527 (2009) - François Arnault, Thierry P. Berger, Cédric Lauradoux, Marine Minier, Benjamin Pousse:
A new approach for FCSRs. IACR Cryptol. ePrint Arch. 2009: 167 (2009) - Gilad Asharov, Yehuda Lindell:
Utility Dependence in Correct and Fair Rational Secret Sharing. IACR Cryptol. ePrint Arch. 2009: 373 (2009) - Giuseppe Ateniese, Paolo Gasti:
Universally Anonymous IBE based on the Quadratic Residuosity Assumption. IACR Cryptol. ePrint Arch. 2009: 280 (2009) - Jean-Philippe Aumasson, Çagdas Çalik, Willi Meier, Onur Özen, Raphael C.-W. Phan, Kerem Varici:
Improved Cryptanalysis of Skein. IACR Cryptol. ePrint Arch. 2009: 438 (2009) - Jean-Philippe Aumasson, Itai Dinur, Luca Henzen, Willi Meier, Adi Shamir:
Efficient FPGA Implementations of High-Dimensional Cube Testers on the Stream Cipher Grain-128. IACR Cryptol. ePrint Arch. 2009: 218 (2009) - Jean-Philippe Aumasson, Orr Dunkelman, Sebastiaan Indesteege, Bart Preneel:
Cryptanalysis of Dynamic SHA(2). IACR Cryptol. ePrint Arch. 2009: 184 (2009) - Michael Backes, Dennis Hofheinz, Dominique Unruh:
CoSP: A General Framework For Computational Soundness Proofs. IACR Cryptol. ePrint Arch. 2009: 80 (2009) - Daniel V. Bailey, Brian Baldwin, Lejla Batina, Daniel J. Bernstein, Peter Birkner, Joppe W. Bos, Gauthier Van Damme, Giacomo de Meulenaer, Junfeng Fan, Tim Güneysu, Frank K. Gürkaynak, Thorsten Kleinjung, Tanja Lange, Nele Mentens, Christof Paar, Francesco Regazzoni, Peter Schwabe, Leif Uhsadel:
The Certicom Challenges ECC2-X. IACR Cryptol. ePrint Arch. 2009: 466 (2009) - Daniel V. Bailey, Lejla Batina, Daniel J. Bernstein, Peter Birkner, Joppe W. Bos, Hsieh-Chung Chen, Chen-Mou Cheng, Gauthier Van Damme, Giacomo de Meulenaer, Luis J. Dominguez Perez, Junfeng Fan, Tim Güneysu, Frank K. Gürkaynak, Thorsten Kleinjung, Tanja Lange, Nele Mentens, Ruben Niederhagen, Christof Paar, Francesco Regazzoni, Peter Schwabe, Leif Uhsadel, Anthony Van Herrewege, Bo-Yin Yang:
Breaking ECC2K-130. IACR Cryptol. ePrint Arch. 2009: 541 (2009) - Brian Baldwin, Andrew Byrne, Mark Hamilton, Neil Hanley, Robert P. McEvoy, Weibo Pan, William P. Marnane:
FPGA Implementations of SHA-3 Candidates: CubeHash, Grøstl, Lane, Shabal and Spectral Hash. IACR Cryptol. ePrint Arch. 2009: 342 (2009) - Brian Baldwin, William P. Marnane:
An FPGA Technologies Area Examination of the SHA-3 Hash Candidate Implementations. IACR Cryptol. ePrint Arch. 2009: 603 (2009) - Brian Baldwin, Richard Moloney, Andrew Byrne, Gary McGuire, William P. Marnane:
A Hardware Analysis of Twisted Edwards Curves for an Elliptic Curve Cryptosystem. IACR Cryptol. ePrint Arch. 2009: 1 (2009) - Stéphane Ballet, Robert Rolland:
A NOTE ON YAO'S THEOREM ABOUT PSEUDORANDOM GENERATORS. IACR Cryptol. ePrint Arch. 2009: 548 (2009) - Endre Bangerter, Stefania Barzan, Stephan Krenn, Ahmad-Reza Sadeghi, Thomas Schneider, Joe-Kai Tsay:
Bringing Zero-Knowledge Proofs of Knowledge to Practice. IACR Cryptol. ePrint Arch. 2009: 211 (2009) - Endre Bangerter, Jan Camenisch, Stephan Krenn:
Efficiency Limitations for Sigma-Protocols for Group Homomorphisms. IACR Cryptol. ePrint Arch. 2009: 595 (2009) - Boaz Barak, Iftach Haitner, Dennis Hofheinz, Yuval Ishai:
Bounded Key-Dependent Message Security. IACR Cryptol. ePrint Arch. 2009: 511 (2009) - Johann Barbier, Eric Filiol:
Overview of Turbo-Code Reconstruction Techniques. IACR Cryptol. ePrint Arch. 2009: 68 (2009) - Gregory V. Bard:
The Application of Polynomials over the Field of Two Elements to a Problem in Intellectual Property. IACR Cryptol. ePrint Arch. 2009: 326 (2009)
skipping 608 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-02 01:00 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