Provable Secure Signature Scheme with Partial Sanitization and Disclosure
We present a new signature scheme that allows a signer to specify some parts of a document to be modified or not, so that private statements can be hidden. Our signature scheme has a dynamic policy for disclosure and sanitizations, allowing any party to modify the conditions. Our construction is based on the RSA accumulator, allowing efficient verification in the sense that the size of the signature is independent of the number of sanitized submessages. It is free from expensive computations over elliptic curves. We studied the efficiency of our scheme in terms of communication and computation overheads. Our main theorem shows that the method is secure against existential forgeries in the random oracle model, and secure against modification attacks classified into seven types under the assumptions of the RSA problem, and the one-wayness of the hash function.
Hiroaki Kikuchi Maxi Ueyama Tetsuya Izu Masahiko Takenaka
School of Information Technology, Tokai University, 1117 Kitakaname, Hiratsuka, Kangawa, 259-1292, J Fujitsu Laboratories Ltd., 4-1-1 Kamikodanaka, Nakahara, Kawasaki, Japan 890 Kashimada, Kawasaki, Ka
国际会议
Fourth International Conference，Inscrypt 2008(第四届中国密码学与信息安全国际会议)
北京
英文
37-51
2008-12-01（万方平台首次上网日期，不代表论文的发表时间）