Hybridalpha: An efficient approach for privacy-preserving federated learning
Federated learning has emerged as a promising approach for collaborative and privacy-
preserving learning. Participants in a federated learning process cooperatively train a model …
preserving learning. Participants in a federated learning process cooperatively train a model …
Snarky signatures: Minimal signatures of knowledge from simulation-extractable SNARKs
We construct a pairing based simulation-extractable SNARK (SE-SNARK) that consists of
only 3 group elements and has highly efficient verification. By formally linking SE-SNARKs to …
only 3 group elements and has highly efficient verification. By formally linking SE-SNARKs to …
Fully secure functional encryption for inner products, from standard assumptions
Functional encryption is a modern public-key paradigm where a master secret key can be
used to derive sub-keys SK_F associated with certain functions F in such a way that the …
used to derive sub-keys SK_F associated with certain functions F in such a way that the …
FAME: Fast attribute-based message encryption
Time and again, attribute-based encryption has been shown to be the natural cryptographic
tool for building various types of conditional access systems with far-reaching applications …
tool for building various types of conditional access systems with far-reaching applications …
Legosnark: Modular design and composition of succinct zero-knowledge proofs
We study the problem of building non-interactive proof systems modularly by linking small
specialized" gadget" SNARKs in a lightweight manner. Our motivation is both theoretical and …
specialized" gadget" SNARKs in a lightweight manner. Our motivation is both theoretical and …
Batch Arguments for and More from Standard Bilinear Group Assumptions
Non-interactive batch arguments for NP provide a way to amortize the cost of NP verification
across multiple instances. They enable a prover to convince a verifier of multiple NP …
across multiple instances. They enable a prover to convince a verifier of multiple NP …
Improved dual system ABE in prime-order groups via predicate encodings
We present a modular framework for the design of efficient adaptively secure attribute-based
encryption (ABE) schemes for a large class of predicates under the standard k-Lin …
encryption (ABE) schemes for a large class of predicates under the standard k-Lin …
Decentralized multi-client functional encryption for inner product
J Chotard, E Dufour Sans, R Gay, DH Phan… - Advances in Cryptology …, 2018 - Springer
We consider a situation where multiple parties, owning data that have to be frequently
updated, agree to share weighted sums of these data with some aggregator, but where they …
updated, agree to share weighted sums of these data with some aggregator, but where they …
Multi-input functional encryption for inner products: Function-hiding realizations and constructions without pairings
We present new constructions of multi-input functional encryption (MIFE) schemes for the
inner-product functionality that improve the state of the art solution of Abdalla et al.(Eurocrypt …
inner-product functionality that improve the state of the art solution of Abdalla et al.(Eurocrypt …
Multi-input inner-product functional encryption from pairings
We present a multi-input functional encryption scheme (MIFE) for the inner product
functionality based on the k-Lin assumption in prime-order bilinear groups. Our construction …
functionality based on the k-Lin assumption in prime-order bilinear groups. Our construction …