隐私保护集合交集(private set intersection,PSI)计算属于安全多方计算领域的特定应用问题,不仅具有重要的理论意义也具有很强的应用背景,在大数据时代,对该问题的研究更是符合人们日益强烈的在享受各种服务的同时达到隐私保护的需求....隐私保护集合交集(private set intersection,PSI)计算属于安全多方计算领域的特定应用问题,不仅具有重要的理论意义也具有很强的应用背景,在大数据时代,对该问题的研究更是符合人们日益强烈的在享受各种服务的同时达到隐私保护的需求.对安全多方计算基础理论进行了简要介绍,并重点介绍了目前主流的安全多方计算框架下2类PSI研究技术:传统的基于公钥加密机制,混乱电路,不经意传输的PSI协议和新型的云辅助的PSI协议,并对各类协议的过程、适用性、复杂性进行简要分析总结.同时,也对隐私保护集合交集问题的应用场景进行详细说明,进一步体现对该问题的实际研究价值.随着对该问题的不断深入研究,目前已经设计了在半诚实模型下快速完成上亿元素规模的隐私集合求交集协议.展开更多
The standard method to construct a finite field requires a primitive irreducible polynomial of a given degree. Therefore, it is difficult to apply for the construction of huge finite fields. To avoid this problem, we ...The standard method to construct a finite field requires a primitive irreducible polynomial of a given degree. Therefore, it is difficult to apply for the construction of huge finite fields. To avoid this problem, we propose a new method to construct huge finite fields with the characteristic p = 5 by using an Artin-Schreier tower. Utilizing the recursive basis of the Artin-Schreier tower, we define a nmltiplication algorithm The algorithm can explicitly calculate the multiplication of two elements on the top finite field of this tower, without any primitive element. We also define a linear recurrence equation as an application, which produces a sequence of numbers, and call the new pseudorandom number generator Abstract Syntax Tree （AST） for p = 5. The experircental results show that our new pseudorandom number generator can produce a sequence of numbers with a long period.展开更多
For an almost complex structure J on U R4 pseudo-holomorphically fibered over C a J-holomorphic curve C U can be described by a Weierstrass polynomial. The J-holomorphicity equation descends to a perturbed 8-operator ...For an almost complex structure J on U R4 pseudo-holomorphically fibered over C a J-holomorphic curve C U can be described by a Weierstrass polynomial. The J-holomorphicity equation descends to a perturbed 8-operator on the coefficients; the operator is typically (0, 2/m)-Holder continuous if m is the local degree of C over C. This sheds some light on the problem of parametrizing pseudo-holomorphic deformations of J-holomorphic curve singu-larities.展开更多
By means of a method of analytic number theory the following theorem is proved. Letp be a quasi-homogeneous linear partial differential operator with degreem,m > 0, w.r.t a dilation $\left\{ {\delta _\tau } \right\...By means of a method of analytic number theory the following theorem is proved. Letp be a quasi-homogeneous linear partial differential operator with degreem,m > 0, w.r.t a dilation $\left\{ {\delta _\tau } \right\}{\text{ }}_{\tau< 0} $ given by ( a1, …, an). Assume that either a1, …, an are positive rational numbers or $m{\text{ = }}\sum\limits_{j = 1}^n {\alpha _j \alpha _j } $ for some $\alpha {\text{ = }}\left( {\alpha _1 ,{\text{ }} \ldots {\text{ }},\alpha _n } \right) \in l _ + ^n $ Then the dimension of the space of polynomial solutions of the equationp[u] = 0 on ?n must be infinite展开更多
文摘隐私保护集合交集(private set intersection,PSI)计算属于安全多方计算领域的特定应用问题,不仅具有重要的理论意义也具有很强的应用背景,在大数据时代,对该问题的研究更是符合人们日益强烈的在享受各种服务的同时达到隐私保护的需求.对安全多方计算基础理论进行了简要介绍,并重点介绍了目前主流的安全多方计算框架下2类PSI研究技术:传统的基于公钥加密机制,混乱电路,不经意传输的PSI协议和新型的云辅助的PSI协议,并对各类协议的过程、适用性、复杂性进行简要分析总结.同时,也对隐私保护集合交集问题的应用场景进行详细说明,进一步体现对该问题的实际研究价值.随着对该问题的不断深入研究,目前已经设计了在半诚实模型下快速完成上亿元素规模的隐私集合求交集协议.
基金supported by Overseas Scholars Research Fund of Heilongjiang Provinicial Education Department
文摘The standard method to construct a finite field requires a primitive irreducible polynomial of a given degree. Therefore, it is difficult to apply for the construction of huge finite fields. To avoid this problem, we propose a new method to construct huge finite fields with the characteristic p = 5 by using an Artin-Schreier tower. Utilizing the recursive basis of the Artin-Schreier tower, we define a nmltiplication algorithm The algorithm can explicitly calculate the multiplication of two elements on the top finite field of this tower, without any primitive element. We also define a linear recurrence equation as an application, which produces a sequence of numbers, and call the new pseudorandom number generator Abstract Syntax Tree （AST） for p = 5. The experircental results show that our new pseudorandom number generator can produce a sequence of numbers with a long period.
文摘For an almost complex structure J on U R4 pseudo-holomorphically fibered over C a J-holomorphic curve C U can be described by a Weierstrass polynomial. The J-holomorphicity equation descends to a perturbed 8-operator on the coefficients; the operator is typically (0, 2/m)-Holder continuous if m is the local degree of C over C. This sheds some light on the problem of parametrizing pseudo-holomorphic deformations of J-holomorphic curve singu-larities.
基金the National Natural Science Foundation of China (Grnat No. 19971068) .
文摘By means of a method of analytic number theory the following theorem is proved. Letp be a quasi-homogeneous linear partial differential operator with degreem,m > 0, w.r.t a dilation $\left\{ {\delta _\tau } \right\}{\text{ }}_{\tau< 0} $ given by ( a1, …, an). Assume that either a1, …, an are positive rational numbers or $m{\text{ = }}\sum\limits_{j = 1}^n {\alpha _j \alpha _j } $ for some $\alpha {\text{ = }}\left( {\alpha _1 ,{\text{ }} \ldots {\text{ }},\alpha _n } \right) \in l _ + ^n $ Then the dimension of the space of polynomial solutions of the equationp[u] = 0 on ?n must be infinite
