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 23 matches
- 2020
- Behzad Abdolmaleki, Helger Lipmaa, Janno Siim, Michal Zajac:
On QA-NIZK in the BPK Model. Public Key Cryptography (1) 2020: 590-620 - Masayuki Abe, Miguel Ambrona, Miyako Ohkubo:
On Black-Box Extensions of Non-interactive Zero-Knowledge Arguments, and Signatures Directly from Simulation Soundness. Public Key Cryptography (1) 2020: 558-589 - Shweta Agrawal, Benoît Libert, Monosij Maitra, Radu Titiu:
Adaptive Simulation Security for Inner Product Functional Encryption. Public Key Cryptography (1) 2020: 34-64 - Thomas Agrikola, Geoffroy Couteau, Dennis Hofheinz:
The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO. Public Key Cryptography (1) 2020: 187-219 - Carsten Baum, Ariel Nof:
Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application to Lattice-Based Cryptography. Public Key Cryptography (1) 2020: 495-526 - Rishiraj Bhattacharyya:
Memory-Tight Reductions for Practical Key Encapsulation Mechanisms. Public Key Cryptography (1) 2020: 249-278 - Nairen Cao, Adam O'Neill, Mohammad Zaheri:
Toward RSA-OAEP Without Random Oracles. Public Key Cryptography (1) 2020: 279-308 - Suvradip Chakraborty, Manoj Prabhakaran, Daniel Wichs:
Witness Maps and Applications. Public Key Cryptography (1) 2020: 220-246 - Vanesa Daza, Carla Ràfols, Alexandros Zacharakis:
Updateable Inner Product Argument with Logarithmic Verifier and Applications. Public Key Cryptography (1) 2020: 527-557 - David Derler, Kai Samelin, Daniel Slamanig:
Bringing Order to Chaos: The Case of Collision-Resistant Chameleon-Hashes. Public Key Cryptography (1) 2020: 462-492 - Benjamin Dowling, Paul Rösler, Jörg Schwenk:
Flexible Authenticated and Confidential Channel Establishment (fACCE): Analyzing the Noise Protocol Framework. Public Key Cryptography (1) 2020: 341-373 - Sanjam Garg, Romain Gay, Mohammad Hajiabadi:
Master-Key KDM-Secure IBE from Pairings. Public Key Cryptography (1) 2020: 123-152 - Romain Gay:
A New Paradigm for Public-Key Functional Encryption for Degree-2 Polynomials. Public Key Cryptography (1) 2020: 95-120 - Nicholas Genise, Daniele Micciancio, Chris Peikert, Michael Walter:
Improved Discrete Gaussian and Subgaussian Analysis for Lattice Cryptography. Public Key Cryptography (1) 2020: 623-651 - Siyao Guo, Pritish Kamath, Alon Rosen, Katerina Sotiraki:
Limits on the Efficiency of (Ring) LWE Based Non-interactive Key Exchange. Public Key Cryptography (1) 2020: 374-395 - Shaoquan Jiang, Guang Gong, Jingnan He, Khoa Nguyen, Huaxiong Wang:
PAKEs: New Framework, New Techniques and More Efficient Lattice-Based Constructions in the Standard Model. Public Key Cryptography (1) 2020: 396-427 - Qiqi Lai, Feng-Hao Liu, Zhedong Wang:
Almost Tight Security in Lattices with Polynomial Moduli - PRF, IBE, All-but-many LTF, and More. Public Key Cryptography (1) 2020: 652-681 - Roman Langrehr, Jiaxin Pan:
Hierarchical Identity-Based Encryption with Tight Multi-challenge Security. Public Key Cryptography (1) 2020: 153-183 - Chris Peikert, Sina Shiehian:
Constraining and Watermarking PRFs from Milder Assumptions. Public Key Cryptography (1) 2020: 431-461 - Najmeh Soroush, Vincenzo Iovino, Alfredo Rial, Peter B. Rønne, Peter Y. A. Ryan:
Verifiable Inner Product Encryption Scheme. Public Key Cryptography (1) 2020: 65-94 - Shifeng Sun, Amin Sakzad, Ron Steinfeld, Joseph K. Liu, Dawu Gu:
Public-Key Puncturable Encryption: Modular and Compact Constructions. Public Key Cryptography (1) 2020: 309-338 - Junichi Tomida, Yuto Kawahara, Ryo Nishimaki:
Fast, Compact, and Expressive Attribute-Based Encryption. Public Key Cryptography (1) 2020: 3-33 - Aggelos Kiayias, Markulf Kohlweiss, Petros Wallden, Vassilis Zikas:
Public-Key Cryptography - PKC 2020 - 23rd IACR International Conference on Practice and Theory of Public-Key Cryptography, Edinburgh, UK, May 4-7, 2020, Proceedings, Part I. Lecture Notes in Computer Science 12110, Springer 2020, ISBN 978-3-030-45373-2 [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-11-25 05: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