( en | de | ru )

 

Disambiguation of "Tackmann, Björn"

Author of the publication

copydeleteadd this publication to your clipboard
From Single-Bit to Multi-bit Public-Key Encryption via Non-malleable Codes.

, , , and . TCC (1), volume 9014 of Lecture Notes in Computer Science, page 532-560. Springer, (2015)

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.

Saskia Björn

Bolli Björnsson

Ulf Björner

Erik Björnemo

Gerhard Björnsen

 

Other publications of authors with the same name

Key Exchange with Unilateral Authentication: Composable Security Definition and Modular Protocol Design., , and . IACR Cryptology ePrint Archive, (2013)Multi-Protocol UC and its Use for Building Modular and Efficient Protocols., , and . IACR Cryptology ePrint Archive, (2019)Per-session security: Password-based cryptography revisited., , , and . J. Comput. Secur., 27 (1): 75-111 (2019)The Transaction Graph for Modeling Blockchain Semantics., , , , and . IACR Cryptol. ePrint Arch., (2017)Anonymity-Preserving Public-Key Encryption: A Constructive Approach., , , , and . Privacy Enhancing Technologies, volume 7981 of Lecture Notes in Computer Science, page 19-39. Springer, (2013)A Constructive Perspective on Key Encapsulation., , and . Number Theory and Cryptography, volume 8260 of Lecture Notes in Computer Science, page 226-239. Springer, (2013)Privacy-preserving auditable token payments in a permissioned blockchain system., , , , , and . AFT, page 255-267. ACM, (2020)On Composable Security for Digital Signatures., , and . Public Key Cryptography (1), volume 10769 of Lecture Notes in Computer Science, page 494-523. Springer, (2018)Moderately Hard Functions: Definition, Instantiations, and Applications., and . TCC (1), volume 10677 of Lecture Notes in Computer Science, page 493-526. Springer, (2017)Query-Complexity Amplification for Random Oracles., , , and . ICITS, volume 9063 of Lecture Notes in Computer Science, page 159-180. Springer, (2015)