Susan Hohenberger

According to our database1, Susan Hohenberger authored at least 56 papers between 2003 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Registered Attribute-Based Encryption.
IACR Cryptol. ePrint Arch., 2022

2021
A Performance Evaluation of Pairing-Based Broadcast Encryption Systems.
IACR Cryptol. ePrint Arch., 2021

PPE Circuits for Rational Polynomials.
Proceedings of the CCS '21: 2021 ACM SIGSAC Conference on Computer and Communications Security, Virtual Event, Republic of Korea, November 15, 2021

2020
New Methods and Abstractions for RSA-Based Forward Secure Signatures.
IACR Cryptol. ePrint Arch., 2020

Chosen Ciphertext Security from Injective Trapdoor Functions.
IACR Cryptol. ePrint Arch., 2020

PPE Circuits: Formal Definition to Software Automation.
Proceedings of the CCS '20: 2020 ACM SIGSAC Conference on Computer and Communications Security, 2020

2019
Are These Pairing Elements Correct? Automated Verification and Applications.
IACR Cryptol. ePrint Arch., 2019

2018
Synchronized Aggregate Signatures from the RSA Assumption.
IACR Cryptol. ePrint Arch., 2018

2017
A Generic Approach to Constructing and Proving Verifiable Random Functions.
IACR Cryptol. ePrint Arch., 2017

Signature Schemes with Randomized Verification.
Proceedings of the Applied Cryptography and Network Security, 2017

2015
Computing on Authenticated Data.
J. Cryptol., 2015

An Overview of ANONIZE: A Large-Scale Anonymous Survey System.
IEEE Secur. Priv., 2015

ANONIZE: A Large-Scale Anonymous Survey System.
IACR Cryptol. ePrint Arch., 2015

New Circular Security Counterexamples from Decision Linear and Learning with Errors.
IACR Cryptol. ePrint Arch., 2015

Automating Fast and Secure Translations from Type-I to Type-III Pairing Schemes.
IACR Cryptol. ePrint Arch., 2015

2014
Machine-generated algorithms, proofs and software for the batch verification of digital signature schemes.
J. Comput. Secur., 2014

Online/Offline Attribute-Based Encryption.
IACR Cryptol. ePrint Arch., 2014

Universal Signature Aggregators.
IACR Cryptol. ePrint Arch., 2014

Adaptively Secure Puncturable Pseudorandom Functions in the Standard Model.
IACR Cryptol. ePrint Arch., 2014

2013
Attribute-Based Encryption with Fast Decryption.
IACR Cryptol. ePrint Arch., 2013

Replacing a Random Oracle: Full Domain Hash From Indistinguishability Obfuscation.
IACR Cryptol. ePrint Arch., 2013

Full Domain Hash from (Leveled) Multilinear Maps and Identity-Based Aggregate Signatures.
IACR Cryptol. ePrint Arch., 2013

Using SMT solvers to automate design tasks for encryption and signature schemes.
Proceedings of the 2013 ACM SIGSAC Conference on Computer and Communications Security, 2013

2012
Batch Verification of Short Signatures.
J. Cryptol., 2012

Detecting Dangerous Queries: A New Approach for Chosen Ciphertext Security.
IACR Cryptol. ePrint Arch., 2012

New Definitions and Separations for Circular Security.
Proceedings of the Public Key Cryptography - PKC 2012, 2012

2011
Access controls for oblivious and anonymous systems.
ACM Trans. Inf. Syst. Secur., 2011

Securely Obfuscating Re-Encryption.
J. Cryptol., 2011

Outsourcing the Decryption of ABE Ciphertexts.
Proceedings of the 20th USENIX Security Symposium, 2011

2010
Constructing Verifiable Random Functions with Large Input Spaces.
IACR Cryptol. ePrint Arch., 2010

CPA and CCA-Secure Encryption Systems that are not 2-Circular Secure.
IACR Cryptol. ePrint Arch., 2010

Practical Adaptive Oblivious Transfer from Simple Assumptions.
IACR Cryptol. ePrint Arch., 2010

Synchronized Aggregate Signatures: New Definitions, Constructions and Applications.
IACR Cryptol. ePrint Arch., 2010

2009
Short and Stateless Signatures from the RSA Assumption.
IACR Cryptol. ePrint Arch., 2009

Realizing Hash-and-Sign Signatures under Standard Assumptions.
IACR Cryptol. ePrint Arch., 2009

Controlling Access to an Oblivious Database Using Stateful Anonymous Credentials.
Proceedings of the Public Key Cryptography, 2009

2008
Universally Composable Adaptive Oblivious Transfer.
IACR Cryptol. ePrint Arch., 2008

Practical Short Signature Batch Verification.
IACR Cryptol. ePrint Arch., 2008

Key-Private Proxy Re-Encryption.
IACR Cryptol. ePrint Arch., 2008

2007
Blind Identity-Based Encryption and Simulatable Oblivious Transfer.
IACR Cryptol. ePrint Arch., 2007

On Tweaking Luby-Rackoff Blockciphers.
IACR Cryptol. ePrint Arch., 2007

Chosen-Ciphertext Secure Proxy Re-Encryption.
IACR Cryptol. ePrint Arch., 2007

2006
Advances in signatures, encryption, and E-Cash from bilinear groups.
PhD thesis, 2006

Improved proxy re-encryption schemes with applications to secure distributed storage.
ACM Trans. Inf. Syst. Secur., 2006

How to Win the Clone Wars: Efficient Periodic n-Times Anonymous Authentication.
IACR Cryptol. ePrint Arch., 2006

Balancing Accountability and Privacy Using E-Cash (Extended Abstract).
Proceedings of the Security and Cryptography for Networks, 5th International Conference, 2006

Lightweight Email Signatures (Extended Abstract).
Proceedings of the Security and Cryptography for Networks, 5th International Conference, 2006

Honest-Verifier Private Disjointness Testing Without Random Oracles.
Proceedings of the Privacy Enhancing Technologies, 6th International Workshop, 2006

How to win the clonewars: efficient periodic n-times anonymous authentication.
Proceedings of the 13th ACM Conference on Computer and Communications Security, 2006

2005
Compact E-Cash.
IACR Cryptol. ePrint Arch., 2005

Proxy Re-Signatures: New Definitions, Algorithms, and Applications.
IACR Cryptol. ePrint Arch., 2005

Practical Group Signatures without Random Oracles.
IACR Cryptol. ePrint Arch., 2005

How to Securely Outsource Cryptographic Computations.
Proceedings of the Theory of Cryptography, Second Theory of Cryptography Conference, 2005

Lightweight Encryption for Email.
Proceedings of the Steps to Reducing Unwanted Traffic on the Internet Workshop, 2005

2004
Tetris is hard, even to approximate.
Int. J. Comput. Geom. Appl., 2004

2003
Tetris is Hard, Even to Approximate.
Proceedings of the Computing and Combinatorics, 9th Annual International Conference, 2003


  Loading...