Остановите войну!
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 32 matches
- 2016
- Nuttapong Attrapadung, Goichiro Hanaoka, Kazuto Ogawa, Go Ohtake, Hajime Watanabe, Shota Yamada:
Attribute-Based Encryption for Range Attributes. SCN 2016: 42-61 - Carsten Baum:
On Garbling Schemes with and Without Privacy. SCN 2016: 468-485 - Christof Beierle:
Pen and Paper Arguments for SIMON and SIMON-like Designs. SCN 2016: 431-446 - Amos Beimel, Oriol Farràs, Naty Peter:
Secret Sharing Schemes for Dense Forbidden Graphs. SCN 2016: 509-528 - Silvio Biagioni, Daniel Masny, Daniele Venturi:
Naor-Yung Paradigm with Shared Randomness and Applications. SCN 2016: 62-80 - Alexandra Boldyreva, Taesoo Kim, Richard J. Lipton, Bogdan Warinschi:
Provably-Secure Remote Memory Attestation for Heap Overflow Protection. SCN 2016: 83-103 - Tatiana Bradley, Sky Faber, Gene Tsudik:
Bounded Size-Hiding Private Set Intersection. SCN 2016: 449-467 - Zvika Brakerski, Or Dagmi:
Shorter Circuit Obfuscation in Challenging Security Models. SCN 2016: 551-570 - Jan Camenisch, Robert R. Enderlein, Ueli Maurer:
Memory Erasability Amplification. SCN 2016: 104-125 - Jan Camenisch, Anja Lehmann, Gregory Neven, Kai Samelin:
Virtual Smart Cards: How to Sign with a Password and a Server. SCN 2016: 353-371 - Dario Catalano, Mario Di Raimondo, Simone Faro:
Verifiable Pattern Matching on Outsourced Texts. SCN 2016: 333-350 - Jie Chen, Benoît Libert, Somindu C. Ramanna:
Non-zero Inner Product Encryption with Short Ciphertexts and Private Keys. SCN 2016: 23-41 - Ashish Choudhury, Emmanuela Orsini, Arpita Patra, Nigel P. Smart:
Linear Overhead Optimally-Resilient Robust MPC Using Preprocessing. SCN 2016: 147-168 - Ran Cohen, Chris Peikert:
On Adaptively Secure Multiparty Computation with a Short CRS. SCN 2016: 129-146 - Yi Deng, Juan A. Garay, San Ling, Huaxiong Wang, Moti Yung:
On the Implausibility of Constant-Round Public-Coin Zero-Knowledge Proofs. SCN 2016: 237-253 - Shlomi Dolev, Karim El Defrawy, Joshua Lampkins, Rafail Ostrovsky, Moti Yung:
Proactive Secret Sharing with a Dishonest Majority. SCN 2016: 529-548 - Georg Fuchsbauer, Christian Hanser, Chethan Kamath, Daniel Slamanig:
Practical Round-Optimal Blind Signatures in the Standard Model from Weaker Assumptions. SCN 2016: 391-408 - Eiichiro Fujisaki:
Improving Practical UC-Secure Commitments Based on the DDH Assumption. SCN 2016: 257-272 - Esha Ghosh, Michael T. Goodrich, Olga Ohrimenko, Roberto Tamassia:
Verifiable Zero-Knowledge Order Queries and Updates for Fully Dynamic Lists and Trees. SCN 2016: 216-236 - Trotta Gnam:
Zero-Knowledge Made Easy so It Won't Make You Dizzy - (A Tale of Transaction Put in Verse About an Illicit Kind of Commerce). SCN 2016: 191-197 - Matthew D. Green, Jonathan Katz, Alex J. Malozemoff, Hong-Sheng Zhou:
A Unified Approach to Idealized Model Separations via Indistinguishability Obfuscation. SCN 2016: 587-603 - Carmit Hazay, Muthuramakrishnan Venkitasubramaniam:
What Security Can We Achieve Within 4 Rounds? SCN 2016: 486-505 - Carmit Hazay, Hila Zarosim:
The Feasibility of Outsourced Database Search in the Plain Model. SCN 2016: 313-332 - Brett Hemenway, Steve Lu, Rafail Ostrovsky, William Welser IV:
High-Precision Secure Computation of Satellite Collision Probabilities. SCN 2016: 169-187 - Jongkil Kim, Willy Susilo, Fuchun Guo, Man Ho Au:
A Tag Based Encoding: An Efficient Encoding for Predicate Encryption in Prime Order Groups. SCN 2016: 3-22 - Antonio Marcedone, Rafael Pass, Abhi Shelat:
Bounded KDM Security from iO and OWF. SCN 2016: 571-586 - Arno Mittelbach, Daniele Venturi:
Fiat-Shamir for Highly Sound Protocols Is Instantiable. SCN 2016: 198-215 - Chris Peikert:
How (Not) to Instantiate Ring-LWE. SCN 2016: 411-430 - Rafaël del Pino, Vadim Lyubashevsky, David Pointcheval:
The Whole is Less Than the Sum of Its Parts: Constructing More Efficient Lattice-Based AKEs. SCN 2016: 273-291 - Leonid Reyzin, Sophia Yakoubov:
Efficient Asynchronous Accumulators for Distributed PKI. SCN 2016: 292-309
skipping 2 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-08-22 20:49 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