default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFlorian Böhl
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[c9]Ralph Ankele, Florian Böhl, Simon Friedberger:
MergeMAC: A MAC for Authentication with Strict Time Constraints and Limited Bandwidth. ACNS 2018: 381-399- [i7]Ralph Ankele, Florian Böhl, Simon Friedberger:
MergeMAC: A MAC for Authentication with Strict Time Constraints and Limited Bandwidth. IACR Cryptol. ePrint Arch. 2018: 342 (2018) - 2016
- [j2]Florian Böhl, Dominique Unruh:
Symbolic universal composability. J. Comput. Secur. 24(1): 1-38 (2016) - 2015
- [j1]Florian Böhl, Dennis Hofheinz, Tibor Jager, Jessica Koch, Christoph Striecks
:
Confined Guessing: New Signatures From Standard Assumptions. J. Cryptol. 28(1): 176-208 (2015) - 2014
- [b1]Florian Böhl:
Symbolic Analysis of Cryptographic Protocols. Karlsruhe Institute of Technology, 2014 - [c8]Florian Böhl, Simon Greiner, Patrik Scheidecker:
Proving Correctness and Security of Two-Party Computation Implemented in Java in Presence of a Semi-honest Sender. CANS 2014: 175-190 - [c7]Florian Böhl, Gareth T. Davies, Dennis Hofheinz:
Encryption Schemes Secure under Related-Key and Key-Dependent Message Attacks. Public Key Cryptography 2014: 483-500 - [c6]Bernhard Beckert, Sarah Grebing, Florian Böhl:
A Usability Evaluation of Interactive Theorem Provers Using Focus Groups. SEFM Workshops 2014: 3-19 - [c5]Bernhard Beckert, Sarah Grebing, Florian Böhl:
How to Put Usability into Focus: Using Focus Groups to Evaluate the Usability of Interactive Theorem Provers. UITP 2014: 4-13 - [i6]Florian Böhl, Simon Greiner, Patrik Scheidecker:
Proving Correctness and Security of Two-Party Computation Implemented in Java in Presence of a Semi-Honest Sender. IACR Cryptol. ePrint Arch. 2014: 618 (2014) - 2013
- [c4]Florian Böhl, Véronique Cortier, Bogdan Warinschi:
Deduction soundness: prove one, get five for free. CCS 2013: 1261-1272 - [c3]Florian Böhl, Dominique Unruh:
Symbolic Universal Composability. CSF 2013: 257-271 - [c2]Florian Böhl, Dennis Hofheinz, Tibor Jager, Jessica Koch, Jae Hong Seo, Christoph Striecks:
Practical Signatures from Standard Assumptions. EUROCRYPT 2013: 461-485 - [i5]Florian Böhl, Dominique Unruh:
Symbolic Universal Composability. IACR Cryptol. ePrint Arch. 2013: 62 (2013) - [i4]Florian Böhl, Dennis Hofheinz, Tibor Jager, Jessica Koch, Christoph Striecks:
Confined Guessing: New Signatures From Standard Assumptions. IACR Cryptol. ePrint Arch. 2013: 171 (2013) - [i3]Florian Böhl, Véronique Cortier, Bogdan Warinschi:
Deduction Soundness: Prove One, Get Five for Free. IACR Cryptol. ePrint Arch. 2013: 457 (2013) - [i2]Florian Böhl, Gareth T. Davies, Dennis Hofheinz:
RKA-KDM secure encryption from public-key encryption. IACR Cryptol. ePrint Arch. 2013: 653 (2013) - 2012
- [c1]Florian Böhl, Dennis Hofheinz, Daniel Kraschewski:
On Definitions of Selective Opening Security. Public Key Cryptography 2012: 522-539 - 2011
- [i1]Florian Böhl, Dennis Hofheinz, Daniel Kraschewski:
On definitions of selective opening security. IACR Cryptol. ePrint Arch. 2011: 678 (2011)
Coauthor Index
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.
last updated on 2024-04-25 05:42 CEST 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:
