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 28 matches
- 2018
- Christian Müller, Helmut Seidl, Eugen Zalinescu:
Inductive Invariants for Noninterference in Multi-agent Workflows. CSF 2018: 247-261 - José Bacelar Almeida, Manuel Barbosa, Gilles Barthe, Hugo Pacheco, Vitor Pereira, Bernardo Portela:
Enforcing Ideal-World Leakage Bounds in Real-World Secret Sharing MPC Frameworks. CSF 2018: 132-146 - Mário S. Alvim, Konstantinos Chatzikokolakis, Catuscia Palamidessi, Anna Pazii:
Invited Paper: Local Differential Privacy on Metric Spaces: Optimizing the Trade-Off with Utility. CSF 2018: 262-267 - Maxime Audinot, Sophie Pinchinat, Barbara Kordy:
Guided Design of Attack Trees: A System-Based Approach. CSF 2018: 61-75 - Cécile Baritel-Ruet, François Dupressoir, Pierre-Alain Fouque, Benjamin Grégoire:
Formal Security Proof of CMAC and Its Variants. CSF 2018: 91-104 - Gilles Barthe, Benjamin Grégoire, Vincent Laporte:
Secure Compilation of Side-Channel Countermeasures: The Case of Cryptographic "Constant-Time". CSF 2018: 328-343 - David A. Basin, Sasa Radomirovic, Lara Schmid:
Alethea: A Provably Secure Random Sample Voting Protocol. CSF 2018: 283-297 - Bruno Blanchet:
Composition Theorems for CryptoVerif and Application to TLS 1.3. CSF 2018: 16-30 - Borzoo Bonakdarpour, Bernd Finkbeiner:
The Complexity of Monitoring Hyperproperties. CSF 2018: 162-174 - Hongxu Chen, Alwen Tiu, Zhiwu Xu, Yang Liu:
A Permission-Dependent Type System for Secure Information Flow Analysis. CSF 2018: 218-232 - Vincent Cheval, Véronique Cortier, Mathieu Turuani:
A Little More Conversation, a Little Less Action, a Lot More Satisfaction: Global States in ProVerif. CSF 2018: 344-358 - Andrey Chudnov, David A. Naumann:
Assuming You Know: Epistemic Semantics of Relational Annotations for Expressive Flow Policies. CSF 2018: 189-203 - Véronique Cortier, Constantin Catalin Dragan, François Dupressoir, Bogdan Warinschi:
Machine-Checked Proofs for Electronic Voting: Privacy and Verifiability for Belenios. CSF 2018: 298-312 - Jannik Dreier, Lucca Hirschi, Sasa Radomirovic, Ralf Sasse:
Automated Unbounded Verification of Stateful Cryptographic Protocols with Exclusive OR. CSF 2018: 359-373 - Patrick Eugster, Giorgia Azzurra Marson, Bertram Poettering:
A Cryptographic Look at Multi-party Channels. CSF 2018: 31-45 - Marc Fischlin, Christian Janson, Sogol Mazaheri:
Backdoored Hash Functions: Immunizing HMAC and HKDF. CSF 2018: 105-118 - Marc Fischlin, Sogol Mazaheri:
Self-Guarding Cryptographic Protocols against Algorithm Substitution Attacks. CSF 2018: 76-90 - Helene Haagh, Aleksandr Karbyshev, Sabine Oechsner, Bas Spitters, Pierre-Yves Strub:
Computer-Aided Proofs for Multiparty Computation with Active Security. CSF 2018: 119-131 - Andreas V. Hess, Sebastian Mödersheim:
A Typing Result for Stateful Protocols. CSF 2018: 374-388 - Everett Hildenbrandt, Manasvi Saxena, Nishant Rodrigues, Xiaoran Zhu, Philip Daian, Dwight Guth, Brandon M. Moore, Daejun Park, Yi Zhang, Andrei Stefanescu, Grigore Rosu:
KEVM: A Complete Formal Semantics of the Ethereum Virtual Machine. CSF 2018: 204-217 - Charlie Jacomme, Steve Kremer:
An Extensive Formal Analysis of Multi-factor Authentication Protocols. CSF 2018: 1-15 - Ilia Lebedev, Kyle Hogan, Srinivas Devadas:
Invited Paper: Secure Boot and Remote Attestation in the Sanctum Processor. CSF 2018: 46-60 - Baiyu Li, Daniele Micciancio:
Symbolic Security of Garbled Circuits. CSF 2018: 147-161 - Pasquale Malacaria, M. H. R. Khouzani, Corina S. Pasareanu, Quoc-Sang Phan, Kasper Søe Luckow:
Symbolic Side-Channel Analysis for Probabilistic Programs. CSF 2018: 313-327 - McKenna McCall, Hengrun Zhang, Limin Jia:
Knowledge-Based Security of Dynamic Secrets for Reactive Programs. CSF 2018: 175-188 - Vineet Rajani, Deepak Garg:
Types for Information Flow Control: Labeling Granularity and Semantic Models. CSF 2018: 233-246 - Samuel Yeom, Irene Giacomelli, Matt Fredrikson, Somesh Jha:
Privacy Risk in Machine Learning: Analyzing the Connection to Overfitting. CSF 2018: 268-282 - 31st IEEE Computer Security Foundations Symposium, CSF 2018, Oxford, United Kingdom, July 9-12, 2018. IEEE Computer Society 2018, ISBN 978-1-5386-6680-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 2024-12-25 03:43 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