An ambiguous optimistic fair exchange protocol with traceability
暂无分享,去创建一个
Mahmoud Salmasizadeh | Maryam Rajabzadeh Asaar | Ramin Ganjavi | M. R. Asaar | M. Salmasizadeh | R. Ganjavi
[1] Guomin Yang,et al. Ambiguous Optimistic Fair Exchange , 2008, ASIACRYPT.
[2] Yi Mu,et al. Preserving Transparency and Accountability in Optimistic Fair Exchange of Digital Signatures , 2011, IEEE Transactions on Information Forensics and Security.
[3] Yevgeniy Dodis,et al. Breaking and repairing optimistic fair exchange from PODC 2003 , 2003, DRM '03.
[4] Koutarou Suzuki,et al. Traceable Ring Signature , 2007, Public Key Cryptography.
[5] Guomin Yang,et al. Efficient Optimistic Fair Exchange Secure in the Multi-user Setting and Chosen-Key Model without Random Oracles , 2008, CT-RSA.
[6] Yael Tauman Kalai,et al. How to Leak a Secret: Theory and Applications of Ring Signatures , 2001, Essays in Memory of Shimon Even.
[7] Yevgeniy Dodis,et al. Optimistic Fair Exchange in a Multi-user Setting , 2007, J. Univers. Comput. Sci..
[8] N. Asokan,et al. Optimistic Fair Exchange of Digital Signatures (Extended Abstract) , 1998, EUROCRYPT.
[9] N. Asokan,et al. Optimistic protocols for fair exchange , 1997, CCS '97.
[10] Amit Sahai,et al. Efficient Non-interactive Proof Systems for Bilinear Groups , 2008, EUROCRYPT.
[11] Leslie Lamport,et al. Constructing Digital Signatures from a One Way Function , 2016 .
[12] Eiichiro Fujisaki. Sub-linear Size Traceable Ring Signatures without Random Oracles , 2011, CT-RSA.
[13] Yi Mu,et al. Optimistic Fair Exchange of Ring Signatures , 2011, SecureComm.
[14] Amos Fiat,et al. How to Prove Yourself: Practical Solutions to Identification and Signature Problems , 1986, CRYPTO.