-
Article
The Complexity of Grid Coloring
A c-coloring of the grid GN,M = [N] × [M] is a map** of GN,M into [c] such that no four corners forming a rectangle have the same color. In 2009 a challenge was proposed to find a 4-coloring of G17,17. Though a...
-
Chapter and Conference Paper
Nonmalleable Digital Lockers and Robust Fuzzy Extractors in the Plain Model
We give the first constructions in the plain model of 1) nonmalleable digital lockers (Canetti and Varia, TCC 2009) and 2) robust fuzzy extractors (Boyen et al., Eurocrypt 2005) that secure sources with entrop...
-
Chapter and Conference Paper
SoK: How (not) to Design and Implement Post-quantum Cryptography
Post-quantum cryptography has known a Cambrian explosion in the last decade. What started as a very theoretical and mathematical area has now evolved into a sprawling research field, complete with side-channel...
-
Chapter and Conference Paper
Combinatorial Rank Attacks Against the Rectangular Simple Matrix Encryption Scheme
In 2013, Tao et al. introduced the ABC Simple Matrix Scheme for Encryption, a multivariate public key encryption scheme. The scheme boasts great efficiency in encryption and decryption, though it suffers from...
-
Chapter and Conference Paper
Cryptanalysis of LEDAcrypt
We report on the concrete cryptanalysis of LEDAcrypt, a 2nd Round candidate in NIST’s Post-Quantum Cryptography standardization process and one of 17 encryption schemes that remain as candidates for near-term ...
-
Chapter and Conference Paper
Constant-Round Group Key Exchange from the Ring-LWE Assumption
Group key-exchange protocols allow a set of N parties to agree on a shared, secret key by communicating over a public network
-
Chapter and Conference Paper
Efficient, Reusable Fuzzy Extractors from LWE
A fuzzy extractor (FE) enables reproducible generation of high-quality randomness from noisy inputs having sufficient min-entropy. FEs have been proposed for deriving cryptographic keys from biometric data. FE...
-
Chapter and Conference Paper
Deniable Attribute Based Encryption for Branching Programs from LWE
Deniable encryption (Canetti et al. CRYPTO ’97) is an intriguing primitive that provides a security guarantee against not only eavesdrop** attacks as required by semantic security, but also stronger coercion...
-
Chapter and Conference Paper
Verifiable Oblivious Storage
We formalize the notion of Verifiable Oblivious Storage (VOS), where a client outsources the storage of data to a server while ensuring data confidentiality, access pattern privacy, and integrity and freshness of...
