Gregory M. Zaverucha

Orcid: 0009-0000-7513-6728

According to our database1, Gregory M. Zaverucha authored at least 37 papers between 2007 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Beyond the circuit: How to Minimize Foreign Arithmetic in ZKP Circuits.
IACR Cryptol. ePrint Arch., 2024

Verifiable Encryption from MPC-in-the-Head.
IACR Commun. Cryptol., 2024

2023
Oblivious issuance of proofs.
IACR Cryptol. ePrint Arch., 2023

2022
Efficient Lifting for Shorter Zero-Knowledge Proofs and Post-Quantum Signatures.
IACR Cryptol. ePrint Arch., 2022

Proof-of-possession for KEM certificates using verifiable generation.
IACR Cryptol. ePrint Arch., 2022

Proofs of discrete logarithm equality across groups.
IACR Cryptol. ePrint Arch., 2022

2021
Side-Channel Protections for Picnic Signatures.
IACR Trans. Cryptogr. Hardw. Embed. Syst., 2021

Shorter Signatures Based on Tailor-Made Minimalist Symmetric-Key Crypto.
IACR Cryptol. ePrint Arch., 2021

MPC-Friendly Symmetric Cryptography from Alternating Moduli: Candidates, Protocols, and Applications.
IACR Cryptol. ePrint Arch., 2021

Banquet: Short and Fast Signatures from AES.
IACR Cryptol. ePrint Arch., 2021

2020
Improving the Performance of the Picnic Signature Scheme.
IACR Trans. Cryptogr. Hardw. Embed. Syst., 2020

An Attack on Some Signature Schemes Constructed From Five-Pass Identification Schemes.
IACR Cryptol. ePrint Arch., 2020

2019
Are Certificate Thumbprints Unique?
IACR Cryptol. ePrint Arch., 2019

The Signal Private Group System and Anonymous Credentials Supporting Efficient Verifiable Encryption.
IACR Cryptol. ePrint Arch., 2019

Security of Hedged Fiat-Shamir Signatures under Fault Attacks.
IACR Cryptol. ePrint Arch., 2019

2017
Post-Quantum Zero-Knowledge and Signatures from Symmetric-Key Primitives.
IACR Cryptol. ePrint Arch., 2017

2016
Efficient Post-Quantum Zero-Knowledge and Signatures.
IACR Cryptol. ePrint Arch., 2016

2015
Authenticated Network Time Synchronization.
IACR Cryptol. ePrint Arch., 2015

2014
Algebraic MACs and Keyed-Verification Anonymous Credentials.
Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, 2014

2013
MAC Schemes with Efficient Protocols and Keyed-Verification Anonymous Credentials.
IACR Cryptol. ePrint Arch., 2013

Montgomery Multiplication Using Vector Instructions.
IACR Cryptol. ePrint Arch., 2013

A TPM Diffie-Hellman Oracle.
IACR Cryptol. ePrint Arch., 2013

2012
Hybrid Encryption in the Multi-User Setting.
IACR Cryptol. ePrint Arch., 2012

2011
Short one-time signatures.
Adv. Math. Commun., 2011

Oblivious Transfer with Hidden Access Control Policies.
Proceedings of the Public Key Cryptography - PKC 2011, 2011

2010
Hash Families and Cover-Free Families with Cryptographic Applications.
PhD thesis, 2010

Pairing-Based Onion Routing with Improved Forward Secrecy.
ACM Trans. Inf. Syst. Secur., 2010

Anonymity in shared symmetric key primitives.
Des. Codes Cryptogr., 2010

Constant-Size Commitments to Polynomials and Their Applications.
Proceedings of the Advances in Cryptology - ASIACRYPT 2010, 2010

2009
Group Testing and Batch Verification.
IACR Cryptol. ePrint Arch., 2009

Private Intersection of Certified Sets.
Proceedings of the Financial Cryptography and Data Security, 2009

2008
Some Improved Bounds for Secure Frameproof Codes and Related Separating Hash Families.
IEEE Trans. Inf. Theory, 2008

A bound on the size of separating hash families.
J. Comb. Theory A, 2008

2007
On the complexity of Katamari Damacy.
ACM Crossroads, 2007

Anonymity and security in delay tolerant networks.
Proceedings of the Third International Conference on Security and Privacy in Communication Networks and the Workshops, 2007

Web Based Health Recommender System Using Rough Sets, Survival Analysis and Rule-Based Expert Systems.
Proceedings of the Rough Sets, 2007

Pairing-Based Onion Routing.
Proceedings of the Privacy Enhancing Technologies, 7th International Symposium, 2007


  Loading...