[1]POUPARD G, STERN J. Fair encryption of RSA keys[C]// ENROCRYPT’00, LNCS 1807. Berlin: Springer-Verlag, 2000:173-189.[2]YOUNG A, YUNG M. Auto-recoverable auto-certifiable cryptosystems[C]// EUROCRYPT’98, LNCS 1403. Berlin: Springer-Verlag, 1998:17-31.[3]STADLER M. Publicly verifiable secret sharing[C]// EURO-CRYPT’96, LNCS 1070.Berlin: Springer-Verlag,1996:191-199.[4]CAMENISHCH J, MAURER U, STADLER M. Digital payment systems with passive anonymity revoking trustees[C]// Computer Security-ESORICS’96, LNCS 1146. Berlin: Springer-Verlag, 1996:33-43.[5]FRANKEL Y, TSIOUNIS Y, YUNG M. Indirect discourse proofs: achieving efficient fair on-line e-cash[C]// ASIACRYPT’96, LNCS 1163. Berlin: Springer-Verlag, 1996:68-82.[6]BELLARE M, GOLDWASSER S. Encapsulated key escrow, TR688[R]. Cambridge: MIT Laboratory for Computer Science, 1996.[7]ASOTAN N, SHOUP V, WAIDNER M. Optimistic fair exchange of digital signatures[J]. IEEE Journal on Selected Areas in Communications, 2000, 18(4): 591-610.[8]伍前红,王继林,袁素春,等. 可公开验证的ElGama/RSA加密[J]. 电子与信息学报,2005,27(4):608-611.[9]CANETTI R, GOLDREICH O, HALEVI S. The random oracle methodology, revisited[J]. Journal of the ACM, 2004, 51(4):557-594.[10]NIETO J M G, MANULIS M, POETTERING B, et al. Publicly verifiable ciphertexts[C]// SCN'12: Proceedings of the 8th International Conference on Security and Cryptography for Networks, LNCS 7485. Berlin: Springer-Verlag, 2012: 393-410.[11]CAMENISCH J, SHOUP V. Practical verifiable encryption and decryption of discrete logarithms[C] CRYPTO’03: 23rd Annual International Cryptology Conference, LNCS 2729. Berlin: Springer-Verlag, 2003:126-144.[12]CRAMER R, SHOUP V. A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack[C]// CRYPTO’98, LNCS 1462. Berlin: Springer-Verlag, 1998:13-25.[13]冯登国. 可证明安全性理论与方法研究[J]. 软件学报,2005,16(10):1743-1756.[14]FUJISAKE E, OKAMOTO T. Statistical zero knowledge protocols to prove modular polynomial relations[C]// CRYPTO’97, LNCS 1294. Berlin: Springer -Verlag, 1997:1294:16-30.[15]CHAUM D, WALLET P R. Databases with observers[C]//CRYPTO’92, LNCS 740. Berlin: Springer-Verlag, 1992::89-105. |