The arithmetic codex
The arithmetic codex
复制标题
算术法典
DOI：
--
复制
发表时间：
2012
期刊：
影响因子：
--
通讯作者：
C. Xing
中科院分区：
文献类型：
--
作者：
Ignacio Cascudo;R. Cramer;C. Xing
在这个邀请演讲中，我们介绍算术法典的概念，或简称为法典。它包含了密码学（算术秘密共享方案，享有加法和乘法属性）和代数复杂性理论（乘法的双线性复杂性）在一个自然的数学框架中的几个完善的概念。算术秘密共享方案在多方安全计算甚至两方密码学中有重要的应用。有趣的是，最近的几个应用程序的两方密码学依赖于现有的结果“渐近良好的家庭”的合适的这种计划。此外，这些计划的建设需要渐近良好的塔的功能领域在有限领域：没有小学（概率）的建设是已知的，在这些情况下。除了介绍概念，我们讨论了一些结构，以及一些限制。
In this invited talk,1 we introduce the notion of arithmetic codex, or codex for short. It encompasses several well-established notions from cryptography (arithmetic secret sharing schemes, which enjoy additive as well as multiplicative properties) and algebraic complexity theory (bilinear complexity of multiplication) in a natural mathematical framework. Arithmetic secret sharing schemes have important applications to secure multi-party computation and even to two-party cryptography. Interestingly, several recent applications to two-party cryptography rely crucially on the existing results on “asymptotically good families” of suitable such schemes. Moreover, the construction of these schemes requires asymptotically good towers of function fields over finite fields: no elementary (probabilistic) constructions are known in these cases. Besides introducing the notion, we discuss some of the constructions, as well as some limitations.
关于零知识协议的摊销复杂性
影响因子：
3
作者：
Cramer R
通讯作者：
Cramer R