PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Brzuska, Christina"

Author of the publication

copydeleteadd this publication to your clipboard
Physically Uncloneable Functions in the Universal Composition Framework.

, , , and . IACR Cryptology ePrint Archive, (2011)

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.

Christina Michalak University of Stuttgart

Christina Ungerer University of Stuttgart

Christina Karagianni University of Stuttgart

Christina Sotiriadou University of Stuttgart

Christina Abele University of Stuttgart

 

Other publications of authors with the same name

Less is More: Relaxed yet Composable Security Notions for Key Exchange., , , , and . IACR Cryptology ePrint Archive, (2012)Physically Uncloneable Functions in the Universal Composition Framework., , , and . CRYPTO, volume 6841 of Lecture Notes in Computer Science, page 51-70. Springer, (2011)Arithmetic Cryptography., , and . IACR Cryptology ePrint Archive, (2015)Efficient and Perfectly Unlinkable Sanitizable Signatures without Group Signatures., , and . EuroPKI, volume 8341 of Lecture Notes in Computer Science, page 12-30. Springer, (2013)Using Indistinguishability Obfuscation via UCEs., and . ASIACRYPT (2), volume 8874 of Lecture Notes in Computer Science, page 122-141. Springer, (2014)Safely Exporting Keys from Secure Channels - On the Security of EAP-TLS and TLS Key Exporters., , and . EUROCRYPT (1), volume 9665 of Lecture Notes in Computer Science, page 670-698. Springer, (2016)TLS, PACE, and EAC: ACryptographic View at Modern Key Exchange Protocols., , and . Sicherheit, volume P-195 of LNI, page 71-82. GI, (2012)Less is more: relaxed yet composable security notions for key exchange., , , , and . Int. J. Inf. Sec., 12 (4): 267-297 (2013)On Statistically Secure Obfuscation with Approximate Correctness., , and . CRYPTO (2), volume 9815 of Lecture Notes in Computer Science, page 551-578. Springer, (2016)Universal Computational Extractors and the Superfluous Padding Assumption for Indistinguishability Obfuscation., and . IACR Cryptology ePrint Archive, (2015)