A note on the polynomial form of Boolean functions and related topics

Falkowski, B.J.

doi:10.1109/12.795128

Cited by 41 publications

(27 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…to the boolean formula or vice versa (e.g., [39], [40], [41]), and ours is just one of the feasible solutions. With Table 6, we can convert arbitrary boolean formula to the polynomial having equivalent value (T → 1, F → 0).…”

Section: General Boolean Formula Evaluationmentioning

confidence: 99%

Collusion-Tolerable Privacy-Preserving Sum and Product Calculation without Secure Channel

Jung

Wan

2015

IEEE Trans. Dependable and Secure Comput.

View full text Add to dashboard Cite

Abstract-Much research has been conducted to securely outsource multiple parties' data aggregation to an untrusted aggregator without disclosing each individual's privately owned data, or to enable multiple parties to jointly aggregate their data while preserving privacy. However, those works either require secure pair-wise communication channels or suffer from high complexity. In this paper, we consider how an external aggregator or multiple parties can learn some algebraic statistics (e.g., sum, product) over participants' privately owned data while preserving the data privacy. We assume all channels are subject to eavesdropping attacks, and all the communications throughout the aggregation are open to others. We first propose several protocols that successfully guarantee data privacy under semi-honest model, and then present advanced protocols which tolerate up to k passive adversaries who do not try to tamper the computation. Under this weak assumption, we limit both the communication and computation complexity of each participant to a small constant. At the end, we present applications which solve several interesting problems via our protocols.

show abstract

Section: General Boolean Formula Evaluationmentioning

confidence: 99%

Collusion-Tolerable Privacy-Preserving Sum and Product Calculation without Secure Channel

Jung

Wan

2015

IEEE Trans. Dependable and Secure Comput.

View full text Add to dashboard Cite

show abstract

“…Experiments with industrial circuits have shown that our algorithm is effective for solving large-dimensional problems (in experiments, coefficients took values up to 2 100 ); none of the known methods can solve such problems. Latest results in arithmetical logic, including linearization of models, are reviewed in [13].…”

Section: Introductionmentioning

confidence: 99%

Malyugin's Theorems: A New Concept in Logical Control, VLSI Design, and Data Structures for New Technologies

Shmerko

2004

Automation and Remote Control

View full text Add to dashboard Cite

show abstract

“…A recent discussion [3] shows the origins and earlier work on bitlevel and word-level polynomial expressions for switching and multiple-valued (MV) functions. It was motivated by the study in [17], where the references are restricted mainly to Western research work.…”

Section: Introductionmentioning

confidence: 99%

A discussion on the history of research in arithmetic and Reed-Muller expressions

Stanković¹,

Sasao

2001

IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst.

View full text Add to dashboard Cite

show abstract

A note on the polynomial form of Boolean functions and related topics

Cited by 41 publications

References 29 publications

Collusion-Tolerable Privacy-Preserving Sum and Product Calculation without Secure Channel

Collusion-Tolerable Privacy-Preserving Sum and Product Calculation without Secure Channel

Malyugin's Theorems: A New Concept in Logical Control, VLSI Design, and Data Structures for New Technologies

A discussion on the history of research in arithmetic and Reed-Muller expressions

Contact Info

Product

Resources

About