Chris Brzuska

Affiliations:
  • Hamburg University of Technology, Institute for IT Security Analysis, Germany


According to our database1, Chris Brzuska authored at least 47 papers between 2009 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Adaptive Distributional Security for Garbling Schemes with 풪(|x|) Online Complexity.
IACR Cryptol. ePrint Arch., 2024

2023
On Provable White-Box Security in the Strong Incompressibility Model.
IACR Trans. Cryptogr. Hardw. Embed. Syst., 2023

CryptoZoo: A Viewer for Reduction Proofs.
IACR Cryptol. ePrint Arch., 2023

On Derandomizing Yao's Weak-to-Strong OWF Construction.
IACR Cryptol. ePrint Arch., 2023

New Random Oracle Instantiations from Extremely Lossy Functions.
IACR Cryptol. ePrint Arch., 2023

Breaking DPA-protected Kyber via the pair-pointwise multiplication.
IACR Cryptol. ePrint Arch., 2023

Adaptive Distributional Security for Garbling Schemes with 𝒪(|x|) Online Complexity.
Proceedings of the Advances in Cryptology - ASIACRYPT 2023, 2023

2022
Security Analysis of the MLS Key Derivation.
Proceedings of the 43rd IEEE Symposium on Security and Privacy, 2022

On Building Fine-Grained One-Way Functions from Strong Average-Case Hardness.
Proceedings of the Advances in Cryptology - EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Trondheim, Norway, May 30, 2022

2021
A State-Separating Proof for Yao's Garbling Scheme.
IACR Cryptol. ePrint Arch., 2021

Key-schedule Security for the TLS 1.3 Standard.
IACR Cryptol. ePrint Arch., 2021

Cryptographic Security of the MLS RFC, Draft 11.
IACR Cryptol. ePrint Arch., 2021

2020
On the Security Goals of White-Box Cryptography.
IACR Trans. Cryptogr. Hardw. Embed. Syst., 2020

Towards Fine-Grained One-Way Functions from Strong Average-Case Hardness.
IACR Cryptol. ePrint Arch., 2020

2019
White-Box Cryptography: Don't Forget About Grey-Box Attacks.
J. Cryptol., 2019

Security Reductions for White-Box Key-Storage in Mobile Payments.
IACR Cryptol. ePrint Arch., 2019

Doubly half-injective PRGs for incompressible white-box cryptography.
IACR Cryptol. ePrint Arch., 2019

2018
State-Separating Proofs: A Reduction Methodology for Real-World Protocols.
IACR Cryptol. ePrint Arch., 2018

On the Ineffectiveness of Internal Encodings - Revisiting the DCA Attack on White-Box Cryptography.
IACR Cryptol. ePrint Arch., 2018

State Separation for Code-Based Game-Playing Proofs.
Proceedings of the Advances in Cryptology - ASIACRYPT 2018, 2018

2017
Arithmetic Cryptography.
J. ACM, 2017

A Modular Security Analysis of EAP and IEEE 802.11.
IACR Cryptol. ePrint Arch., 2017

2016
Safely Exporting Keys from Secure Channels: On the security of EAP-TLS and TLS Key Exporters.
IACR Cryptol. ePrint Arch., 2016

On Statistically Secure Obfuscation with Approximate Correctness.
IACR Cryptol. ePrint Arch., 2016

Downgrade Resilience in Key-Exchange Protocols.
IACR Cryptol. ePrint Arch., 2016

2015
Universal Computational Extractors and the Superfluous Padding Assumption for Indistinguishability Obfuscation.
IACR Cryptol. ePrint Arch., 2015

Arithmetic Cryptography: Extended Abstract.
Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, 2015

2014
Indistinguishability Obfuscation versus Point Obfuscation with Auxiliary Input.
IACR Cryptol. ePrint Arch., 2014

Using Indistinguishability Obfuscation via UCEs.
IACR Cryptol. ePrint Arch., 2014

Random Oracle Uninstantiability from Indistinguishability Obfuscation.
IACR Cryptol. ePrint Arch., 2014

Indistinguishability Obfuscation and UCEs: The Case of Computationally Unpredictable Sources.
IACR Cryptol. ePrint Arch., 2014

On Basing Size-Verifiable One-Way Functions on NP-Hardness.
Electron. Colloquium Comput. Complex., 2014

Indistinguishability Obfuscation versus Multi-bit Point Obfuscation with Auxiliary Input.
Proceedings of the Advances in Cryptology - ASIACRYPT 2014, 2014

2013
On the foundations of key exchange.
PhD thesis, 2013

Less is more: relaxed yet composable security notions for key exchange.
Int. J. Inf. Sec., 2013

An Analysis of the EMV Channel Establishment Protocol.
IACR Cryptol. ePrint Arch., 2013

Reset Indifferentiability and its Consequences.
IACR Cryptol. ePrint Arch., 2013

Notions of Black-Box Reductions, Revisited.
IACR Cryptol. ePrint Arch., 2013

Efficient and Perfectly Unlinkable Sanitizable Signatures without Group Signatures.
Proceedings of the Public Key Infrastructures, Services and Applications, 2013

2012
TLS, PACE, and EAC: ACryptographic View at Modern Key Exchange Protocols.
Proceedings of the Sicherheit 2012: Sicherheit, 2012

Non-interactive Public Accountability for Sanitizable Signatures.
Proceedings of the Public Key Infrastructures, Services and Applications, 2012

2011
Physically Uncloneable Functions in the Universal Composition Framework.
IACR Cryptol. ePrint Arch., 2011

Composability of bellare-rogaway key exchange protocols.
Proceedings of the 18th ACM Conference on Computer and Communications Security, 2011

2010
Unlinkability of Sanitizable Signatures.
Proceedings of the Public Key Cryptography, 2010

Redactable Signatures for Tree-Structured Data: Definitions and Constructions.
Proceedings of the Applied Cryptography and Network Security, 8th International Conference, 2010

2009
Security of Sanitizable Signatures Revisited.
Proceedings of the Public Key Cryptography, 2009

Santizable Signatures: How to Partially Delegate Control for Authenticated Data.
Proceedings of the BIOSIG 2009, 2009


  Loading...