Susan Hohenberger

According to our database1, Susan Hohenberger authored at least 85 papers between 2002 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2018
Synchronized Aggregate Signatures from the RSA Assumption.
IACR Cryptology ePrint Archive, 2018

Synchronized Aggregate Signatures from the RSA Assumption.
Proceedings of the Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29, 2018

2017
A Generic Approach to Constructing and Proving Verifiable Random Functions.
IACR Cryptology ePrint Archive, 2017

A Generic Approach to Constructing and Proving Verifiable Random Functions.
Proceedings of the Theory of Cryptography - 15th International Conference, 2017

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

2015
Computing on Authenticated Data.
J. Cryptology, 2015

An Overview of ANONIZE: A Large-Scale Anonymous Survey System.
IEEE Security & Privacy, 2015

ANONIZE: A Large-Scale Anonymous Survey System.
IACR Cryptology ePrint Archive, 2015

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

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

Universal Signature Aggregators.
Proceedings of the Advances in Cryptology - EUROCRYPT 2015, 2015

Automating Fast and Secure Translations from Type-I to Type-III Pairing Schemes.
Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, 2015

Adaptively Secure Puncturable Pseudorandom Functions in the Standard Model.
Proceedings of the Advances in Cryptology - ASIACRYPT 2015 - 21st International Conference on the Theory and Application of Cryptology and Information Security, Auckland, New Zealand, November 29, 2015

New Circular Security Counterexamples from Decision Linear and Learning with Errors.
Proceedings of the Advances in Cryptology - ASIACRYPT 2015 - 21st International Conference on the Theory and Application of Cryptology and Information Security, Auckland, New Zealand, November 29, 2015

2014
Machine-generated algorithms, proofs and software for the batch verification of digital signature schemes.
Journal of Computer Security, 2014

Online/Offline Attribute-Based Encryption.
IACR Cryptology ePrint Archive, 2014

Universal Signature Aggregators.
IACR Cryptology ePrint Archive, 2014

Adaptively Secure Puncturable Pseudorandom Functions in the Standard Model.
IACR Cryptology ePrint Archive, 2014

ANONIZE: A Large-Scale Anonymous Survey System.
Proceedings of the 2014 IEEE Symposium on Security and Privacy, 2014

Online/Offline Attribute-Based Encryption.
Proceedings of the Public-Key Cryptography - PKC 2014, 2014

Replacing a Random Oracle: Full Domain Hash from Indistinguishability Obfuscation.
Proceedings of the Advances in Cryptology - EUROCRYPT 2014, 2014

2013
Attribute-Based Encryption with Fast Decryption.
IACR Cryptology ePrint Archive, 2013

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

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

Machine-Generated Algorithms, Proofs and Software for the Batch Verification of Digital Signature Schemes.
IACR Cryptology ePrint Archive, 2013

Attribute-Based Encryption with Fast Decryption.
Proceedings of the Public-Key Cryptography - PKC 2013 - 16th International Conference on Practice and Theory in Public-Key Cryptography, Nara, Japan, February 26, 2013

Full Domain Hash from (Leveled) Multilinear Maps and Identity-Based Aggregate Signatures.
Proceedings of the Advances in Cryptology - CRYPTO 2013, 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. Cryptology, 2012

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

Computing on Authenticated Data.
Proceedings of the Theory of Cryptography - 9th Theory of Cryptography Conference, 2012

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

Detecting Dangerous Queries: A New Approach for Chosen Ciphertext Security.
Proceedings of the Advances in Cryptology - EUROCRYPT 2012, 2012

Machine-generated algorithms, proofs and software for the batch verification of digital signature schemes.
Proceedings of the ACM Conference on Computer and Communications Security, 2012

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

Securely Obfuscating Re-Encryption.
J. Cryptology, 2011

Computing on Authenticated Data.
IACR Cryptology ePrint Archive, 2011

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

Practical Adaptive Oblivious Transfer from Simple Assumptions.
Proceedings of the Theory of Cryptography - 8th Theory of Cryptography Conference, 2011

2010
Constructing Verifiable Random Functions with Large Input Spaces.
IACR Cryptology ePrint Archive, 2010

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

Practical Adaptive Oblivious Transfer from Simple Assumptions.
IACR Cryptology ePrint Archive, 2010

Synchronized Aggregate Signatures: New Definitions, Constructions and Applications.
IACR Cryptology ePrint Archive, 2010

Constructing Verifiable Random Functions with Large Input Spaces.
Proceedings of the Advances in Cryptology - EUROCRYPT 2010, 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Monaco / French Riviera, May 30, 2010

Synchronized aggregate signatures: new definitions, constructions and applications.
Proceedings of the 17th ACM Conference on Computer and Communications Security, 2010

2009
Short and Stateless Signatures from the RSA Assumption.
IACR Cryptology ePrint Archive, 2009

Realizing Hash-and-Sign Signatures under Standard Assumptions.
IACR Cryptology ePrint Archive, 2009

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

Realizing Hash-and-Sign Signatures under Standard Assumptions.
Proceedings of the Advances in Cryptology, 2009

Practical Short Signature Batch Verification.
Proceedings of the Topics in Cryptology, 2009

Key-Private Proxy Re-encryption.
Proceedings of the Topics in Cryptology, 2009

Short and Stateless Signatures from the RSA Assumption.
Proceedings of the Advances in Cryptology, 2009

2008
Universally Composable Adaptive Oblivious Transfer.
IACR Cryptology ePrint Archive, 2008

Practical Short Signature Batch Verification.
IACR Cryptology ePrint Archive, 2008

Access Controls for Oblivious and Anonymous Systems.
IACR Cryptology ePrint Archive, 2008

Key-Private Proxy Re-Encryption.
IACR Cryptology ePrint Archive, 2008

Universally Composable Adaptive Oblivious Transfer.
Proceedings of the Advances in Cryptology, 2008

2007
Blind Identity-Based Encryption and Simulatable Oblivious Transfer.
IACR Cryptology ePrint Archive, 2007

On Tweaking Luby-Rackoff Blockciphers.
IACR Cryptology ePrint Archive, 2007

Chosen-Ciphertext Secure Proxy Re-Encryption.
IACR Cryptology ePrint Archive, 2007

Batch Verification of Short Signatures.
IACR Cryptology ePrint Archive, 2007

Securely Obfuscating Re-encryption.
Proceedings of the Theory of Cryptography, 4th Theory of Cryptography Conference, 2007

Batch Verification of Short Signatures.
Proceedings of the Advances in Cryptology, 2007

Chosen-ciphertext secure proxy re-encryption.
Proceedings of the 2007 ACM Conference on Computer and Communications Security, 2007

Blind Identity-Based Encryption and Simulatable Oblivious Transfer.
Proceedings of the Advances in Cryptology, 2007

On Tweaking Luby-Rackoff Blockciphers.
Proceedings of the Advances in Cryptology, 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 Cryptology ePrint Archive, 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, CCS 2006, Alexandria, VA, USA, Ioctober 30, 2006

2005
Compact E-Cash.
IACR Cryptology ePrint Archive, 2005

Proxy Re-Signatures: New Definitions, Algorithms, and Applications.
IACR Cryptology ePrint Archive, 2005

Improved Proxy Re-Encryption Schemes with Applications to Secure Distributed Storage.
IACR Cryptology ePrint Archive, 2005

Practical Group Signatures without Random Oracles.
IACR Cryptology ePrint Archive, 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

Improved Proxy Re-Encryption Schemes with Applications to Secure Distributed Storage.
Proceedings of the Network and Distributed System Security Symposium, 2005

Compact E-Cash.
Proceedings of the Advances in Cryptology, 2005

Proxy re-signatures: new definitions, algorithms, and applications.
Proceedings of the 12th ACM Conference on Computer and Communications Security, 2005

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

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

2002
Tetris is Hard, Even to Approximate
CoRR, 2002


  Loading...