Incrementally Verifiable Computation
https://eprint.iacr.org/2012/095.pdf
https://iacr.org/archive/tcc2008/49480001/49480001.pdf
1.Security reduction 安全归约（归约通俗的讲，就是把一个密码方案的安全性建立在一个已知的困难问题上。）
2.Adversary/Attack 敌手（一个密码挑战游戏中的进攻方，猜测方）
3.Challenger 挑战者（一个密码挑战游戏中的安全方，保密方）
4.PPT=probabilistic polynomial-time概率多项式时间（一种在多项式时间内运行的算法，）
5.Non-negligible advantage 不可忽略优势（敌手有可能攻击失败；敌手只能以不可忽略的优势成功ε攻破；是优势而不是概率*（统一化描述）* 也不能直接考虑ε=1来处理）
6.Black-box adversary （the adversary having almost no knowledge of the model to be attacked.）
7.Unbounded: the adversary has unbounded computational power. This model often leads to notions of perfect security or statistical security.（完美安全-敌手计算能力无限）
8.Computationally bounded: the adversary is at most a polynomial advantage in computational power over the honest parties. Typically this means that the adversary cannot (except with negligible probability) break the cryptographic primitives being used. For example, typically assume the adversary can not forge signatures of parties not in its control.
9.provably secure 可验证安全的/可证明安全的
10.characteristic
(Let F be a field.The characteristic of F is the smallest integer p such that
pe=0. If for any positive integer p, we have pe ≠ 0, we say the characteristic of F is 0)
11.embedding degree 嵌入度（椭圆曲线中的一个值/扩展域F（q^n1）^n2 is a extension field of Fqn1.And n2 is the embedding degree.
12.Mathematical primitives 数学原语
13.Authentication and non-repudiation 真实性和不可否认性
14.EU-CMA=Existential Unforgeability against chosen-message attacks 存在性不可伪造
15.SU-CMA=Strong Unforgeability against chosen-message attacks 强不可伪造
16.IND-CPA=Indistinguishability under chosen-plaintext attack选择明文攻击下的不可区分性
17.IND-CCA=Indistinguishability under chosen-ciphertext attack选择密文攻击下的不可区分性
18.IBE=Indentity-Based Encryption 身份加密
19.PKG=Private-key generator 私钥生成器
20.msk=master secret key主私钥
21.mpk=master public key 主公钥
22.Finite field 有限域（Galois field 伽罗华域）
23.residueclass 剩余类
24.prime field 素数域
25.binary field 二进制域
26.extension field 扩展域
27.irreducible polynomial 不可约多项式
28.group-based cryptography 群基加密
29.Abelian group 阿贝尔交换群
30.Cyclic group 循环群
31.subgroup 子群
32.generator 生成元
33.divisor 除数
34.confinement attacks
35.order 阶（群的）
36.square-and-multiply 重复平方乘方法
37.elliptic curve group 椭圆曲线群
38.Discrete Logarithm离散对数 DL problem=离散对数问题（Computing x when g^x = h, where g,h ∈ G are not the identity element 1G）
39. l-bit security=Solving a problem with time complexity 2^l
40.algebraic structure代数结构
41.sub-exponential-time 亚指数时间
42.infinity 无穷
43.tangent 切线
44.Bilinear pairing 双线性映射/双线性配对
45.pairing-friendly curve 配对友好曲线
46.symmetric vs asymmetric 对称vs非对称
47.homomorphism 同态
48.arbitrary-length 不定长度
49.tradeoff 权衡
50.hybrid encryption 混合加密
