A survey of provably secure searchable encryption
We survey the notion of provably secure searchable encryption (SE) by giving a complete
and comprehensive overview of the two main SE techniques: searchable symmetric …
and comprehensive overview of the two main SE techniques: searchable symmetric …
Transparent SNARKs from DARK compilers
B Bünz, B Fisch, A Szepieniec - … on the Theory and Applications of …, 2020 - Springer
We construct a new polynomial commitment scheme for univariate and multivariate
polynomials over finite fields, with logarithmic size evaluation proofs and verification time …
polynomials over finite fields, with logarithmic size evaluation proofs and verification time …
Fast multiparty threshold ECDSA with fast trustless setup
R Gennaro, S Goldfeder - Proceedings of the 2018 ACM SIGSAC …, 2018 - dl.acm.org
A threshold signature scheme enables distributed signing among n players such that any
subgroup of size t+1 can sign, whereas any group with t or fewer players cannot. While there …
subgroup of size t+1 can sign, whereas any group with t or fewer players cannot. While there …
Doubly-efficient zkSNARKs without trusted setup
We present a zero-knowledge argument for NP with low communication complexity, low
concrete cost for both the prover and the verifier, and no trusted setup, based on standard …
concrete cost for both the prover and the verifier, and no trusted setup, based on standard …
FESTA: fast encryption from supersingular torsion attacks
We introduce FESTA, an efficient isogeny-based public-key encryption (PKE) protocol based
on a constructive application of the SIDH attacks. At its core, FESTA is based on a novel …
on a constructive application of the SIDH attacks. At its core, FESTA is based on a novel …
Cascaded hand pose regression
We extends the previous 2D cascaded object pose regression work [9] in two aspects so that
it works better for 3D articulated objects. Our first contribution is 3D pose-indexed features …
it works better for 3D articulated objects. Our first contribution is 3D pose-indexed features …
UC non-interactive, proactive, threshold ECDSA with identifiable aborts
Building on the Gennaro & Goldfeder and Lindell & Nof protocols (CCS'18), we present two
threshold ECDSA protocols, for any number of signatories and any threshold, that improve …
threshold ECDSA protocols, for any number of signatories and any threshold, that improve …
Threshold-optimal DSA/ECDSA signatures and an application to bitcoin wallet security
While threshold signature schemes have been presented before, there has never been an
optimal threshold signature algorithm for DSA. The properties of DSA make it quite …
optimal threshold signature algorithm for DSA. The properties of DSA make it quite …
An efficient system for non-transferable anonymous credentials with optional anonymity revocation
J Camenisch, A Lysyanskaya - … Conference on the Theory and Application …, 2001 - Springer
A credential system is a system in which users can obtain credentials from organizations
and demonstrate possession of these credentials. Such a system is anonymous when …
and demonstrate possession of these credentials. Such a system is anonymous when …
Privacy preserving keyword searches on remote encrypted data
YC Chang, M Mitzenmacher - International conference on applied …, 2005 - Springer
We consider the following problem: a user U wants to store his files in an encrypted form on
a remote file server S. Later the user U wants to efficiently retrieve some of the encrypted …
a remote file server S. Later the user U wants to efficiently retrieve some of the encrypted …