搜索结果: 1-8 共查到“军事学 Boolean Circuits”相关记录8条 . 查询时间(0.06 秒)
Faster homomorphic encryption is not enough: improved heuristic for multiplicative depth minimization of Boolean circuits
somewhat homomorphic encryption multiplicative depth Boolean functions
2019/8/27
In somewhat homomorphic encryption schemes (e.g. B/FV, BGV) the size of ciphertexts and the execution performance of homomorphic operations depends heavily on the multiplicative depth. The multiplicat...
MArBled Circuits: Mixing Arithmetic and Boolean Circuits with Active Security
MPC Garbled Circuits Secret Sharing
2019/3/1
There are two main ways of performing computation on private data: one method uses linear secret-sharing, in which additions require no communication and multiplications require two secrets to be broa...
A multi-start heuristic for multiplicative depth minimization of boolean circuits
boolean functions homomorphic encryption multiplicative depth
2017/6/1
In this work we propose a multi-start heuristic which aims at minimizing the multiplicative depth of boolean circuits. The multiplicative depth objective is encountered in the field of homomorphic enc...
In this paper we describe ZKBoo, a proposal for practically efficient zero-knowledge arguments especially tailored for Boolean circuits and report on a proof-of-concept implementation. As an highlight...
Efficient Key-policy Attribute-based Encryption for General Boolean Circuits from Multilinear Maps
attribute-based encryption bilinear map multilinear map
2016/1/9
We propose an efficient Key-policy Attribute-based Encryption (KP-ABE) scheme
for general (monotone) Boolean circuits based on secret sharing and on a very particular and
simple form of leveled mult...
Key-policy Attribute-based Encryption for Boolean Circuits from Bilinear Maps
Boolean Circuits Bilinear Maps
2016/1/8
We propose the first Key-policy Attribute-based Encryption (KP-ABE) scheme
for (monotone) Boolean circuits based on bilinear maps. The construction is based on secret
sharing and just one bilinear m...
Secure Multi-Party Computation of Boolean Circuits with Applications to Privacy in On-Line Marketplaces
implementation
2012/3/28
Protocols for generic secure multi-party computation (MPC) come in two forms: they either represent the function being computed as a boolean circuit, or as an arithmetic circuit over a large field. Ei...
Secure Multi-Party Computation of Boolean Circuits with Applications to Privacy in On-Line Marketplaces
implementation multi-party computation on-line marketplaces
2011/6/9
Protocols for generic secure multi-party computation (MPC) come in two forms: they either represent the function being computed as a boolean circuit, or as an arithmetic circuit over a large field. Ei...