PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Böhl, Florian"

Author of the publication

copydeleteadd this publication to your clipboard
How to Put Usability into Focus: Using Focus Groups to Evaluate the Usability of Interactive Theorem Provers.

, , and . UITP, volume 167 of EPTCS, page 4-13. (2014)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Apl. Prof. Dr. Wolfgang Bohling University of Stuttgart

Florian Lerch University of Stuttgart

Florian Hornung University of Stuttgart

Florian Jaensch University of Stuttgart

Dr. Florian Spohr University of Stuttgart

 

Other publications of authors with the same name

How to Put Usability into Focus: Using Focus Groups to Evaluate the Usability of Interactive Theorem Provers., , and . UITP, volume 167 of EPTCS, page 4-13. (2014)RKA-KDM secure encryption from public-key encryption., , and . IACR Cryptology ePrint Archive, (2013)Confined Guessing: New Signatures From Standard Assumptions., , , , and . IACR Cryptology ePrint Archive, (2013)Encryption Schemes Secure under Related-Key and Key-Dependent Message Attacks., , and . Public Key Cryptography, volume 8383 of Lecture Notes in Computer Science, page 483-500. Springer, (2014)On Definitions of Selective Opening Security., , and . Public Key Cryptography, volume 7293 of Lecture Notes in Computer Science, page 522-539. Springer, (2012)Proving Correctness and Security of Two-Party Computation Implemented in Java in Presence of a Semi-honest Sender., , and . CANS, volume 8813 of Lecture Notes in Computer Science, page 175-190. Springer, (2014)A Usability Evaluation of Interactive Theorem Provers Using Focus Groups., , and . SEFM Workshops, volume 8938 of Lecture Notes in Computer Science, page 3-19. Springer, (2014)Confined Guessing: New Signatures From Standard Assumptions., , , , and . J. Cryptology, 28 (1): 176-208 (2015)Symbolic universal composability., and . Journal of Computer Security, 24 (1): 1-38 (2016)Deduction soundness: prove one, get five for free., , and . ACM Conference on Computer and Communications Security, page 1261-1272. ACM, (2013)