Proceedings of the International Conference on Internet of Things and Cloud Computing 2016
DOI: 10.1145/2896387.2896402
|View full text |Cite
|
Sign up to set email alerts
|

Information Flow Control with Minimal Tag Disclosure

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2017
2017
2017
2017

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(5 citation statements)
references
References 15 publications
0
5
0
Order By: Relevance
“…The first P S I protocol presented by Freedman uses oblivious polynomial evaluation. Kissner and Song also propose protocols in multi‐party settings following this way. In this paper, a polynomial representation of sets is also exploited analogously.…”
Section: Preliminariesmentioning
confidence: 99%
See 4 more Smart Citations
“…The first P S I protocol presented by Freedman uses oblivious polynomial evaluation. Kissner and Song also propose protocols in multi‐party settings following this way. In this paper, a polynomial representation of sets is also exploited analogously.…”
Section: Preliminariesmentioning
confidence: 99%
“…Then g c d ( f A ( x ), f B ( x )) represents the set intersection SASB, where g c d denotes the greatest common divisor. For 2 polynomials f A ( x ) and f B ( x ) of degree d , there exist 2 polynomials μ A ( x ) and μ B ( x ) that the degree are d and chosen uniformly at random from R [ x ], which satisfies the formula μ A f A ( x )+ μ B f B ( x )= γ · g c d ( f A ( x ), f B ( x )) where γ is a uniformly random polynomial. It means that if f A ( x ) and f B ( x ) represent sets S A and S B , then the polynomial μ A ( x ) f A ( x )+ μ B ( x ) f B ( x ) only reflect the information of SASB and no information of elements in S A or S B .…”
Section: Preliminariesmentioning
confidence: 99%
See 3 more Smart Citations