Arithmetic garbling from bilinear maps

DOI10.1007/978-3-030-29962-0_9MaRDI QIDQ2167776zbMATH OpenOpenAlexFDO

Authors Nils Fleischhacker, Giulio Malavolta, Dominique Schröder

Publication date 25 August 2022

Full work available at URL https://doi.org/10.1007/978-3-030-29962-0_9

zbMATH Keywords

key-homomorphic encryption schemenon-zero inner-product predicate encryption schemepolynomial-size circuits

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• How to garble arithmetic circuits
• Hierarchical Predicate Encryption for Inner-Products
• Partial garbling schemes and their applications
• On multiparty garbling of arithmetic circuits
• Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits

Cited in

(8)

• On the untapped potential of encoding predicates by arithmetic circuits and their applications
• Arithmetic cryptography (extended abstract)
• Arithmetic cryptography
• Partial garbling schemes and their applications
• How to garble arithmetic circuits
• New ways to garble arithmetic circuits
• Efficient arithmetic in garbled circuits
• Rate-1 arithmetic garbling from homomorphic secret sharing

This page was built for publication: Arithmetic garbling from bilinear maps

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2167776)