Chuan Chi Wang
ABSTRACT
We show a chosen plaintext attack against the RPC incremental unforgeable encryption scheme. The attack can forge a valid ciphertext efficiently. When Applying to 128-bit block RPC scheme, by the concept of birthday paradox, a forgery ciphertext can be gotten after 224 queries with probability larger than 1/2.
- E. Buonanno, J. Katz and M. Yung. "Incremental Unforgeable Encryption," FSE 2001, LNCS 2355, pp. 109--124, 2002. Google Scholar
Digital Library
- M. Bellare, O. Goldreich and S. Goldwasser, "Incremental cryptography: The case of hashing and signing," Advances in Cryptology -- CRYPTO 94 Proceedings, Lecture Notes in Computer Science Vol. 839, Springer--Verlag, 1994. Google ScholarDigital Library
Index Terms
- Forgery attack on the RPC incremental unforgeable encryption scheme
Recommendations
A Nonrepudiable Threshold Proxy Signature Scheme against Forgery Attack
ICCSP '17: Proceedings of the 2017 International Conference on Cryptography, Security and PrivacySince the first (t, n) threshold proxy signature scheme was proposed, a great deal of work has been done. To avoid dispute, it is necessary to identify the actual signer who generates the proxy signature. To withstand the forgery attack that the ...
Forgery attacks of an identity-based multi-proxy signature scheme
Multi-proxy signature is used to delegate a permission of an owner to at least two proxies in the digital world. Recently, Sahu and Padhye gave a new construction of identity-based multi-proxy signature. Their scheme's security was supported by a ...
Forgery Attack on Two ID-Based Proxy Signature Schemes from Bilinear Pairings
EIDWT '13: Proceedings of the 2013 Fourth International Conference on Emerging Intelligent Data and Web TechnologiesSince Mambo et al. introduced the concept of proxy signature in 1996, many proxy signature schemes have been proposed. Recently, Wang et al. and Zhao et al. proposed an ID-based proxy signature scheme and an ID-based anonymous proxy signature scheme, ...
Comments