Search
Search Results
-
Lattice-Based Polynomial Commitments: Towards Asymptotic and Concrete Efficiency
Polynomial commitments schemes are a powerful tool that enables one party to commit to a polynomial p of degree d , and prove that the committed...
-
The Price of Active Security in Cryptographic Protocols
We construct the first actively-secure Multi-Party Computation (MPC) protocols with an arbitrary number of parties in the dishonest majority setting,...
-
The NP-hard problem of computing the maximal sample variance over interval data is solvable in almost linear time with a high probability
We consider the algorithm by Ferson et al. (Reliab Comput 11(3):207--233, 2005) designed for solving the NP-hard problem of computing the maximal...
-
Bringing Order to Chaos: The Case of Collision-Resistant Chameleon-Hashes
Chameleon-hash functions, introduced by Krawczyk and Rabin (NDSS’00), are trapdoor collision-resistant hash functions parametrized by a public key....
-
Algebraically Structured LWE, Revisited
In recent years, there has been a proliferation of algebraically structured Learning With Errors (LWE) variants, including Ring-LWE, Module-LWE,...
-
-
Tighter Security for Schnorr Identification and Signatures: A High-Moment Forking Lemma for \(\varvec{\Sigma }\)-Protocols
The Schnorr identification and signature schemes have been among the most influential cryptographic protocols of the past 3 decades. Unfortunately,...
-
Simple Constructions from (Almost) Regular One-Way Functions
Two of the most useful cryptographic primitives that can be constructed from one-way functions are pseudorandom generators (PRGs) and universal...
-
Algebraic Global Gadgetry for Surjective Constraint Satisfaction
The constraint satisfaction problem (CSP) on a finite relational structure B is to decide, given a set of constraints on variables where the...
-
Multi-key and Multi-input Predicate Encryption (for Conjunctions) from Learning with Errors
We put forward two natural generalizations of predicate encryption (PE), dubbed multi-key and multi-input PE. More in details, our contributions are...
-
Compact NIZKs from Standard Assumptions on Bilinear Maps
A non-interactive zero-knowledge (NIZK) protocol enables a prover to convince a verifier of the truth of a statement without leaking any other...
-
Watermarking PRFs and PKE Against Quantum Adversaries
We initiate the study of software watermarking against quantum adversaries. A quantum adversary generates a quantum state as a pirate software that...
-
Cryptographic Primitives with Hinting Property
A hinting pseudorandom generator (PRG) is a potentially stronger variant of PRG with a “deterministic” form of circular security with respect to the...
-
Analysis of Multivariate Encryption Schemes: Application to Dob and \({C}^{*}\)
A common strategy for constructing multivariate encryption schemes is to use a central map that is easy to invert over an extension field, along with...
-
Optimizing Rectangle and Boomerang Attacks: A Unified and Generic Framework for Key Recovery
The rectangle attack has shown to be a very powerful form of cryptanalysis against block ciphers. Given a rectangle distinguisher, one expects to...
-
Bitcoin as a Transaction Ledger: A Composable Treatment
Bitcoin is one of the most prominent examples of a distributed cryptographic protocol that is extensively used in reality. Nonetheless, existing...
