搜索结果: 1-2 共查到“密码学 proofs of plaintext knowledge”相关记录2条 . 查询时间(0.098 秒)
Non-malleable encryption with proofs of plaintext knowledge and applications to voting
anonymity applications election schemes
2019/1/16
Non-malleable asymmetric encryption schemes which prove plaintext knowledge are sufficient for secrecy in some domains. For example, ballot secrecy in voting. In these domains, some applications deriv...
Efficient and Non-Malleable Proofs of Plaintext Knowledge and Applications
Efficient and Non-Malleable Proofs Plaintext Knowledge Applications
2009/4/13
We describe very efficient protocols for non-malleable (interactive) proofs of plaintext
knowledge for the RSA, Rabin, Paillier, and El-Gamal encryption schemes whose
security can be proven in the s...