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
- 2023
- Razvan Rosie:
A Minor Note on Obtaining Simpler iO Constructions via Depleted Obfuscators. CANS 2023: 563-587 - Zhiyuan An, Haibo Tian, Chao Chen, Fangguo Zhang:
Deniable Cryptosystems: Simpler Constructions and Achieving Leakage Resilience. ESORICS (1) 2023: 24-44 - Matteo Campanelli, Rosario Gennaro, Kelsey Melissaris, Luca Nizzardo:
Witness-Authenticated Key Exchange, Revisited: Extensions to Groups, Improved Models, Simpler Constructions. FC (1) 2023: 112-128 - Zhiyuan An, Haibo Tian, Chao Chen, Fangguo Zhang:
Deniable Cryptosystems: Simpler Constructions and Achieving Leakage Resilience. IACR Cryptol. ePrint Arch. 2023: 705 (2023) - 2022
- Matteo Campanelli, Rosario Gennaro, Kelsey Melissaris, Luca Nizzardo:
Witness-Authenticated Key Exchange Revisited: Improved Models, Simpler Constructions, Extensions to Groups. IACR Cryptol. ePrint Arch. 2022: 382 (2022) - 2021
- Andrei D. Polyanin, Vsevolod G. Sorokin:
Construction of exact solutions to nonlinear PDEs with delay using solutions of simpler PDEs without delay. Commun. Nonlinear Sci. Numer. Simul. 95: 105634 (2021) - 2020
- Pooya Farshim, Georg Fuchsbauer, Alain Passelègue:
Simpler Constructions of Asymmetric Primitives from Obfuscation. INDOCRYPT 2020: 715-738 - (Withdrawn) A Simpler and Modular Construction of Linkable Ring Signature. IACR Cryptol. ePrint Arch. 2020: 333 (2020)
- 2019
- (Withdrawn) A simpler construction of traceable and linkable ring signature scheme. IACR Cryptol. ePrint Arch. 2019: 1303 (2019)
- 2018
- Gongming Zhao, Miaomiao Tian:
A Simpler Construction of Identity-Based Ring Signatures from Lattices. ProvSec 2018: 277-291 - Pooya Farshim, Georg Fuchsbauer, Alain Passelègue:
Simpler Constructions of Asymmetric Primitives from Obfuscation. IACR Cryptol. ePrint Arch. 2018: 576 (2018) - 2017
- Zheng Yang, Junyu Lai, Chao Liu, Wanping Liu, Shuangqing Li:
Simpler Generic Constructions for Strongly Secure One-round Key Exchange from Weaker Assumptions. Comput. J. 60(8): 1145-1160 (2017) - Fuyuki Kitagawa, Ryo Nishimaki, Keisuke Tanaka:
Indistinguishability Obfuscation: Simpler Constructions using Secret-Key Functional Encryption. IACR Cryptol. ePrint Arch. 2017: 275 (2017) - 2014
- Joseph Vandehey:
A Simpler Normal Number Construction for Simple Lüroth Series. J. Integer Seq. 17(6): 14.6.1 (2014) - 2008
- Ricardo Riaza, Roswitha März:
A simpler construction of the matrix chain defining the tractability index of linear DAEs. Appl. Math. Lett. 21(4): 326-331 (2008) - Eissa Nematollahi, Tamás Terlaky:
A simpler and tighter redundant Klee-Minty construction. Optim. Lett. 2(3): 403-414 (2008) - 2006
- Yehuda Lindell:
A Simpler Construction of CCA2-Secure Public-KeyEncryption under General Assumptions. J. Cryptol. 19(3): 359-377 (2006) - 2003
- Yehuda Lindell:
A Simpler Construction of CCA2-Secure Public-Key Encryption under General Assumptions. EUROCRYPT 2003: 241-254 - 2002
- Yehuda Lindell:
A Simpler Construction of CCA2-Secure Public-Key Encryption Under General Assumptions. IACR Cryptol. ePrint Arch. 2002: 57 (2002) - 1989
- Jens M. Dill:
A counter-example for "A simpler construction for showing the intrinsically exponential complexity of the circularity problem for attribute grammars". J. ACM 36(1): 92-96 (1989) - Joost Engelfriet:
The complexity of the circularity problem for attribute grammars: a note on a counterexample for a simpler construction. SIGACT News 20(3): 57-59 (1989) - Michael C. McCord:
Slot Grammar: A System for Simpler Construction of Practical Natural Language Grammars. Natural Language and Logic 1989: 118-145 - 1981
- Mehdi Jazayeri:
A Simpler Construction for Showing the Intrinsically Exponential Complexity of the Circularity Problem for Attribute Grammars. J. ACM 28(4): 715-720 (1981)
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-09-20 12:54 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