Generic groups are an important tool for analyzing the feasibility and in-feasibility of group-
based cryptosystems. There are two distinct wide-spread versions of generic groups …

Recently, a number of highly optimized threshold signing protocols for Schnorr signatures
have been proposed. While these proposals contain important new techniques, some of …

The generic-group model (GGM) aims to capture algorithms working over groups of prime
order that only rely on the group operation, but do not exploit any additional structure given …

In modern cryptography, relatively few instantiations of foundational cryptographic primitives
are used across most cryptographic protocols. For example, elliptic curve groups are …

We present mining-based techniques to reduce the size of various cryptographic outputs
without loss of security. Our approach can be generalized for multiple primitives, such as …

We revisit computationally relaxed locally decodable codes (crLDCs)(Blocki et al., Trans. Inf.
Theory'21) and give two new constructions. Our first construction is a Hamming crLDC that is …

The rapid development and wide popularity of electric power IoT has brought convenience
to people's daily lives. Comprehensive informatization and intelligent transformation of the …

We examine new ways in which coding theory and cryptography continue to be composed
together, and show that the composition of these two fields yield new constructions in the …