Georg Fuchsbauer

According to our database1, Georg Fuchsbauer authored at least 70 papers between 2008 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Schnorr Signatures are Tightly Secure in the ROM under a Non-interactive Assumption.
IACR Cryptol. ePrint Arch., 2024

On Security Proofs of Existing Equivalence Class Signature Schemes.
IACR Cryptol. ePrint Arch., 2024

On Proving Equivalence Class Signatures Secure from Non-interactive Assumptions.
Proceedings of the Public-Key Cryptography - PKC 2024, 2024

Concurrently Secure Blind Schnorr Signatures.
Proceedings of the Advances in Cryptology - EUROCRYPT 2024, 2024

Updatable Public-Key Encryption, Revisited.
Proceedings of the Advances in Cryptology - EUROCRYPT 2024, 2024

2022
Double-authentication-preventing signatures in the standard model.
J. Comput. Secur., 2022

(Concurrently Secure) Blind Schnorr from Schnorr.
IACR Cryptol. ePrint Arch., 2022

Non-interactive Mimblewimble transactions, revisited.
IACR Cryptol. ePrint Arch., 2022

SNACKs: Leveraging Proofs of Sequential Work for Blockchain Light Clients.
IACR Cryptol. ePrint Arch., 2022

Credential Transparency System.
Proceedings of the Security and Cryptography for Networks - 13th International Conference, 2022

2021
Approximate Distance-Comparison-Preserving Symmetric Encryption.
IACR Cryptol. ePrint Arch., 2021

The One-More Discrete Logarithm Assumption in the Generic Group Model.
IACR Cryptol. ePrint Arch., 2021

2020
Transferable E-cash: A Cleaner Model and the First Practical Instantiation.
IACR Cryptol. ePrint Arch., 2020

A Classification of Computational Assumptions in the Algebraic Group Model.
IACR Cryptol. ePrint Arch., 2020

Efficient Signatures on Randomizable Ciphertexts.
IACR Cryptol. ePrint Arch., 2020

Blind Schnorr Signatures and Signed ElGamal Encryption in the Algebraic Group Model.
Proceedings of the Advances in Cryptology - EUROCRYPT 2020, 2020

2019
Security of Symmetric Primitives against Key-Correlated Attacks.
IACR Trans. Symmetric Cryptol., 2019

Structure-Preserving Signatures on Equivalence Classes and Constant-Size Anonymous Credentials.
J. Cryptol., 2019

Blind Schnorr Signatures in the Algebraic Group Model.
IACR Cryptol. ePrint Arch., 2019

WI Is Not Enough: Zero-Knowledge Contingent (Service) Payments Revisited.
IACR Cryptol. ePrint Arch., 2019

2018
Aggregate Cash Systems: A Cryptographic Investigation of Mimblewimble.
IACR Cryptol. ePrint Arch., 2018

Non-interactive zaps of knowledge.
IACR Cryptol. ePrint Arch., 2018

Adaptively Secure Proxy Re-encryption.
IACR Cryptol. ePrint Arch., 2018

Weakly Secure Equivalence-Class Signatures from Standard Assumptions.
IACR Cryptol. ePrint Arch., 2018

Simpler Constructions of Asymmetric Primitives from Obfuscation.
IACR Cryptol. ePrint Arch., 2018

The Algebraic Group Model and its Applications.
Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

2017
Access Control Encryption for Equality, Comparison, and More.
IACR Cryptol. ePrint Arch., 2017

Subversion-zero-knowledge SNARKs.
IACR Cryptol. ePrint Arch., 2017

SpaceMint: A Cryptocurrency Based on Proofs of Space.
ERCIM News, 2017

2016
Structure-Preserving Signatures and Commitments to Group Elements.
J. Cryptol., 2016

A Quasipolynomial Reduction for Generalized Selective Decryption on Trees.
IACR Cryptol. ePrint Arch., 2016

Practical Round-Optimal Blind Signatures in the Standard Model from Weaker Assumptions.
IACR Cryptol. ePrint Arch., 2016

NIZKs with an Untrusted CRS: Security in the Face of Parameter Subversion.
IACR Cryptol. ePrint Arch., 2016

Constrained PRFs for Unbounded Inputs with Short Keys.
IACR Cryptol. ePrint Arch., 2016

Standard Security Does Imply Security Against Selective Opening for Markov Distributions.
Proceedings of the Theory of Cryptography - 13th International Conference, 2016

BeleniosRF: A Non-interactive Receipt-Free Electronic Voting Scheme.
Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, 2016

2015
Spacemint: A Cryptocurrency Based on Proofs of Space.
IACR Cryptol. ePrint Arch., 2015

Practical Round-Optimal Blind Signatures in the Standard Model.
IACR Cryptol. ePrint Arch., 2015

BeleniosRF: A Strongly Receipt-Free Electronic Voting Scheme.
IACR Cryptol. ePrint Arch., 2015

Offline Witness Encryption.
IACR Cryptol. ePrint Arch., 2015

Key-Homomorphic Constrained Pseudorandom Functions.
IACR Cryptol. ePrint Arch., 2015

Anonymous Transferable E-Cash.
Proceedings of the Public-Key Cryptography - PKC 2015 - 18th IACR International Conference on Practice and Theory in Public-Key Cryptography, Gaithersburg, MD, USA, March 30, 2015

Policy Privacy in Cryptographic Access Control.
Proceedings of the IEEE 28th Computer Security Foundations Symposium, 2015

2014
Adaptive Security of Constrained PRFs.
IACR Cryptol. ePrint Arch., 2014

EUF-CMA-Secure Structure-Preserving Signatures on Equivalence Classes.
IACR Cryptol. ePrint Arch., 2014

Breaking Existential Unforgeability of a Signature Scheme from Asiacrypt 2014.
IACR Cryptol. ePrint Arch., 2014

Constrained Verifiable Random Functions.
IACR Cryptol. ePrint Arch., 2014

Constrained PRFs for Unbounded Inputs.
IACR Cryptol. ePrint Arch., 2014

2013
Short blind signatures.
J. Comput. Secur., 2013

Cryptographically Enforced RBAC.
IACR Cryptol. ePrint Arch., 2013

Policy-Based Signatures.
IACR Cryptol. ePrint Arch., 2013

2012
Enhanced Chosen-Ciphertext Security and Applications.
IACR Cryptol. ePrint Arch., 2012

Efficient Signatures of Knowledge and DAA in the Standard Model.
IACR Cryptol. ePrint Arch., 2012

Plaintext-Checkable Encryption.
Proceedings of the Topics in Cryptology - CT-RSA 2012 - The Cryptographers' Track at the RSA Conference 2012, San Francisco, CA, USA, February 27, 2012

2011
Anonymous attestation with user-controlled linkability.
IACR Cryptol. ePrint Arch., 2011

Signatures on Randomizable Ciphertexts.
Proceedings of the Public Key Cryptography - PKC 2011, 2011

Commuting Signatures and Verifiable Encryption.
Proceedings of the Advances in Cryptology - EUROCRYPT 2011, 2011

Achieving Optimal Anonymity in Transferable E-Cash with a Judge.
Proceedings of the Progress in Cryptology - AFRICACRYPT 2011, 2011

2010
Fair Blind Signatures without Random Oracles.
IACR Cryptol. ePrint Arch., 2010

Commuting Signatures and Verifiable Encryption and an Application to Non-Interactively Delegatable Credentials.
IACR Cryptol. ePrint Arch., 2010

Batch Groth-Sahai.
IACR Cryptol. ePrint Arch., 2010

Public-Key Encryption with Non-Interactive Opening: New Constructions and Stronger Definitions.
Proceedings of the Progress in Cryptology, 2010

Strong Cryptography from Weak Secrets.
Proceedings of the Progress in Cryptology, 2010

2009
Transferable Constant-Size Fair E-Cash.
IACR Cryptol. ePrint Arch., 2009

Automorphic Signatures in Bilinear Groups and an Application to Round-Optimal Blind Signatures.
IACR Cryptol. ePrint Arch., 2009

Proofs on Encrypted Values in Bilinear Groups and an Application to Anonymity of Signatures.
Proceedings of the Pairing-Based Cryptography, 2009

2008
Encrypting Proofs on Pairings and Its Application to Anonymity for Signatures.
IACR Cryptol. ePrint Arch., 2008

Anonymous Consecutive Delegation of Signing Rights: Unifying Group and Proxy Signatures.
IACR Cryptol. ePrint Arch., 2008

Efficient Rational Secret Sharing in Standard Communication Networks.
IACR Cryptol. ePrint Arch., 2008

Anonymous Proxy Signatures.
Proceedings of the Security and Cryptography for Networks, 6th International Conference, 2008


  Loading...