default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch 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
- 2020
- Aydin Abadi
, Michele Ciampi, Aggelos Kiayias, Vassilis Zikas:
Timed Signatures and Zero-Knowledge Proofs - Timestamping in the Blockchain Era -. ACNS (1) 2020: 335-354 - Anand Aiyer, Xiao Liang, Nilu Nalini, Omkant Pandey:
Random Walks and Concurrent Zero-Knowledge. ACNS (1) 2020: 24-44 - Erdem Alkim, Paulo S. L. M. Barreto, Nina Bindel, Juliane Krämer, Patrick Longa, Jefferson E. Ricardini:
The Lattice-Based Digital Signature Scheme qTESLA. ACNS (1) 2020: 441-460 - Reza Azarderakhsh, David Jao, Brian Koziel, Jason T. LeGrow, Vladimir Soukharev, Oleg Taraskin:
How Not to Create an Isogeny-Based PAKE. ACNS (1) 2020: 169-186 - Marina Blanton, Ah Reum Kang, Chen Yuan:
Improved Building Blocks for Secure Multi-party Computation Based on Secret Sharing with Honest Majority. ACNS (1) 2020: 377-397 - Niek J. Bouman, Niels de Vreede:
A Practical Approach to the Secure Computation of the Moore-Penrose Pseudoinverse over the Rationals. ACNS (1) 2020: 398-417 - Niklas Büscher, Daniel Demmler, Nikolaos P. Karvelas, Stefan Katzenbeisser, Juliane Krämer, Deevashwer Rathee, Thomas Schneider, Patrick Struck:
Secure Two-Party Computation in a Quantum World. ACNS (1) 2020: 461-480 - Peter Chvojka, Tibor Jager, Saqib A. Kakvi:
Offline Witness Encryption with Semi-adaptive Security. ACNS (1) 2020: 231-250 - Giovanni Di Crescenzo, Matluba Khodjaeva, Delaram Kahrobaei, Vladimir Shpilrain:
Secure and Efficient Delegation of Elliptic-Curve Pairing. ACNS (1) 2020: 45-66 - Dominic Deuber, Nico Döttling, Bernardo Magri, Giulio Malavolta, Sri Aravinda Krishnan Thyagarajan:
Minting Mechanism for Proof of Stake Blockchains. ACNS (1) 2020: 315-334 - Karim Eldefrawy, Tancrède Lepoint, Antonin Leroux:
Communication-Efficient Proactive Secret Sharing for Dynamic Groups with Dishonest Majorities. ACNS (1) 2020: 3-23 - Antonio Faonio, Dario Fiore:
Improving the Efficiency of Re-randomizable and Replayable CCA Secure Public Key Encryption. ACNS (1) 2020: 271-291 - Rintaro Fujita, Takanori Isobe, Kazuhiko Minematsu:
ACE in Chains: How Risky Is CBC Encryption of Binary Executable Files? ACNS (1) 2020: 187-207 - Shoichi Hirose, Yu Sasaki, Hirotaka Yoshida:
Lesamnta-LW Revisited: Improved Security Analysis of Primitive and New PRF Mode. ACNS (1) 2020: 89-109 - Keitaro Hiwatashi, Satsuya Ohata, Koji Nuida:
An Efficient Secure Division Protocol Using Approximate Multi-bit Product and New Constant-Round Building Blocks. ACNS (1) 2020: 357-376 - Susan Hohenberger, Brent Waters:
New Methods and Abstractions for RSA-Based Forward Secure Signatures. ACNS (1) 2020: 292-312 - Loïs Huguenin-Dumittan, Serge Vaudenay:
Classical Misuse Attacks on NIST Round 2 PQC - The Power of Rank-Based Schemes. ACNS (1) 2020: 208-227 - Aaron Hutchinson, Jason T. LeGrow, Brian Koziel, Reza Azarderakhsh:
Further Optimizations of CSIDH: A Systematic Approach to Efficient Strategies, Permutations, and Bound Vectors. ACNS (1) 2020: 481-501 - Intae Kim, Seong Oun Hwang, Willy Susilo, Joonsang Baek, Jongkil Kim:
Efficient Anonymous Multi-group Broadcast Encryption. ACNS (1) 2020: 251-270 - Liliya Kraleva, Tomer Ashur, Vincent Rijmen:
Rotational Cryptanalysis on MAC Algorithm Chaskey. ACNS (1) 2020: 153-168 - Huy Quoc Le, Dung Hoang Duong, Willy Susilo, Josef Pieprzyk:
Trapdoor Delegation and HIBE from Middle-Product LWE in Standard Model. ACNS (1) 2020: 130-149 - Hilder Vitor Lima Pereira:
Efficient AGCD-Based Homomorphic Encryption for Matrix and Vector Arithmetic. ACNS (1) 2020: 110-129 - Bin Wang, Xiaozhuo Gu, Yingshan Yang:
Saber on ESP32. ACNS (1) 2020: 421-440 - Hailun Yan, Lei Wang, Yaobin Shen, Xuejia Lai:
Tweaking Key-Alternating Feistel Block Ciphers. ACNS (1) 2020: 69-88 - Mauro Conti, Jianying Zhou, Emiliano Casalicchio, Angelo Spognardi:
Applied Cryptography and Network Security - 18th International Conference, ACNS 2020, Rome, Italy, October 19-22, 2020, Proceedings, Part I. Lecture Notes in Computer Science 12146, Springer 2020, ISBN 978-3-030-57807-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 2025-03-02 16:19 CET 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
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
