In the past 15 years, cryptography has made considerable progress in expanding the
adversarial attack model to cover side-channel attacks and has built schemes to provably …

We provide a formal treatment of security of digital signatures against subversion attacks
(SAs). Our model of subversion generalizes previous work in several directions, and is …

摘要侧信道攻击利用密码实现的物理泄露而不是理论弱点来恢复密钥, 对密码系统的安全实现有
严重的现实威胁. 密码设备运行时所产生的能量, 电磁, 缓存和故障输出等侧信息均可能导致密钥 …

Non-malleable codes, defined by Dziembowski, Pietrzak, and Wichs (ICS'10), provide
roughly the following guarantee: if a codeword c encoding some message x is tampered to …

A threshold secret sharing scheme (with threshold t) allows a dealer to share a secret
among a set of parties such that any group of t or more parties can recover the secret and no …

One approach towards basing public-key encryption (PKE) schemes on weak and credible
assumptions is to build “stronger” or more general schemes generically from “weaker” or …

We show a general framework for constructing non-malleable codes against tampering
families with average-case hardness bounds. Our framework adapts ideas from the Naor …

A recent trend in cryptography is to construct cryptosystems that are secure against physical
attacks. Such attacks are usually divided into two classes: the leakage attacks in which the …

Non-malleable codes, introduced as a relaxation of error-correcting codes by Dziembowski,
Pietrzak, and Wichs (ICS'10), provide the security guarantee that the message contained in …

Non-malleable codes, introduced by Dziembowski, Pietrzak, and Wichs (ICS'10) provide the
guarantee that if a codeword c of a message m, is modied by a tampering function f to c' …