
Journal of Computer Science and Technology ›› 2019, Vol. 34 ›› Issue (6): 13661379.doi: 10.1007/s1139001919802
Special Issue: Theory and Algorithms
• Theory and Algorithms • Previous Articles Next Articles
Ge Wu^{1,2,3}, JianChang Lai^{4,*}, FuChun Guo^{2}, Willy Susilo^{2}, Senior Member, IEEE, FuTai Zhang^{5}
[1] Hofheinz D, Nguyen N. On tightly secure primitives in the multiinstance setting. In Proc. the 22nd IACR International Conference on Practice and Theory of PublicKey Cryptography, April 2019, pp.581611. [2] Han J, Yang Y, Liu J, Li J, Liang K, Shen J. Expressive attributebased keyword search with constantsize ciphertext. Soft Comput., 2018, 22(15):51635177. [3] Lai J, Huang Z, Au M, Mao X. Constantsize CCAsecure multihop unidirectional proxy reencryption from indistinguishability obfuscation. In Proc. the 23rd Australasian Conference, July 2018, pp.805812. [4] Yang Y, Liu X, Deng R. Lightweight breakglass access control system for healthcare internetofthings. IEEE Trans. Industrial Informatics, 2018, 14(8):36103617. [5] Galbraith S D, MaloneLee J, Smart N P. Public key signatures in the multiuser setting. Inf. Process. Lett., 2002, 83(5):263266. [6] Bellare M, Boldyreva A, Micali S. Publickey encryption in a multiuser setting:Security proofs and improvements. In Proc. the 19th Int. Conference on the Theory and Application of Cryptographic Techniques, May 2000, pp.259274. [7] Bader C, Hofheinz D, Jager T, Kiltz E, Li Y. Tightlysecure authenticated key exchange. In Proc. the 12th Theory of Cryptography Conference, March 2015, pp.629658. [8] Bader C, Jager T, Li Y, Schäge S. On the impossibility of tight cryptographic reductions. In Proc. the 35th Annual International Conference on the Theory and Applications of Cryptographic Techniques, May 2016, pp.273304. [9] Gjøsteen K, Jager T. Practical and tightlysecure digital signatures and authenticated key exchange. In Proc. the 38th Annual International Cryptology Conference, August 2018, pp.95125. [10] Bader C. Efficient signatures with tight real world security in the randomoracle model. In Proc. the 13th Int. Conference on Cryptology and Network Security, October 2014, pp.370383. [11] Hofheinz D, Jager T. Tightly secure signatures and publickey encryption. Des. Codes Cryptography, 2016, 80(1):2961. [12] Libert B, Joye M, Yung M, Peters T. Concise multichallenge CCAsecure encryption and signatures with almost tight security. In Proc. the 20th Int. Conference on the Theory and Application of Cryptology and Information Security, December 2014, pp.121. [13] Libert B, Peters T, Joye M, Yung M. Compactly hiding linear spansTightly secure constantsize simulationsound QANIZK proofs and applications. In Proc. the 21st Int. Conference on the Theory and Application of Cryptology and Information Security, December 2015, pp.681707. [14] Attrapadung N, Hanaoka G, Yamada S. A framework for identitybased encryption with almost tight security. In Proc. the 21st Int. Conference on the Theory and Application of Cryptology and Information Security, December 2015, pp.521549. [15] Blazy O, Kiltz E, Pan J. (Hierarchical) identitybased encryption from affine message authentication. In Proc. the 34th Annual Cryptology Conference, August 2014, pp.408425. [16] Chen J, Gong J, Weng J. Tightly secure IBE under constantsize master public key. In Proc. the 20th Int. IACR International Conference on Practice and Theory in PublicKey Cryptography, March 2017, pp.207231. [17] Chen J, Wee H. Fully, (almost) tightly secure IBE and dual system groups. In Proc. the 33rd Annual Cryptology Conference, August 2013, pp.435460. [18] Gong J, Chen J, Dong X, Cao Z, Tang S. Extended nested dual system groups, revisited. In Proc. the 19th IACR International Conference on Practice and Theory in PublicKey Cryptography, March 2016, pp.133163. [19] Gong J, Dong X, Chen J, Cao Z. Efficient IBE with tight reduction to standard assumption in the multichallenge setting. In Proc. the 22nd Int. Conference on the Theory and Application of Cryptology and Information Security, December 2016, pp.624654. [20] Hofheinz D, Jia D, Pan J. Identitybased encryption tightly secure under chosenciphertext attacks. In Proc. the 24th Int. Conference on the Theory and Application of Cryptology and Information Security, December 2018, pp.190220. [21] Hofheinz D, Koch J, Striecks C. Identitybased encryption with (almost) tight security in the multiinstance, multiciphertext setting. In Proc. the 18th IACR International Conference on Practice and Theory in PublicKey Cryptography, March 2015, pp.799822. [22] Coron J. Optimal security proofs for PSS and other signature schemes. In Proc. the 21st Int. Conference on the Theory and Applications of Cryptographic Techniques, April 2002, pp.272287. [23] Hofheinz D, Jager T, Knapp E. Waters signatures with optimal security reduction. In Proc. the 15th Int. Conference on Practice and Theory in Public Key Cryptography, May 2012, pp.6683. [24] Kakvi S, Kiltz E. Optimal security proofs for full domain hash, revisited. J. Cryptology, 2018, 31(1):276306. [25] Bellare M, Namprempre C, Pointcheval D, Semanko M. The power of RSA inversion oracles and the security of Chaum's RSAbased blind signature scheme. In Proc. the 5th Int. Conference on Financial Cryptography, February 2002, pp.309328. [26] Boldyreva A. Threshold signatures, multisignatures and blind signatures based on the GapDiffieHellmangroup signature scheme. In Proc. the 6th Int. Workshop on Theory and Practice in Public Key Cryptography, January 2003, pp.3146. [27] Bellare M, Neven G. Transitive signatures:New schemes and proofs. IEEE Trans. Information Theory, 2005, 51(6):21332151. [28] Bellare M, Namprempre C, Neven G. Security proofs for identitybased identification and signature schemes. J. Cryptology, 2009, 22(1):161. [29] de Cristofaro E, Tsudik G. Practical private set intersection protocols with linear complexity. In Proc. the 14th Int. Conference on Financial Cryptography and Data Security, January 2010, pp.143159. [30] Fischlin M, Fleischhacker N. Limitations of the metareduction technique:The case of Schnorr signatures. In Proc. the 32nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, May 2013, pp.444460. [31] Garg S, Bhaskar R, Lokam S. Improved bounds on security reductions for discrete log based signatures. In Proc. the 28th Annual International Cryptology Conference, August 2008, pp.93107. [32] Seurin Y. On the exact security of Schnorrtype signatures in the Random Oracle Model. In Proc. the 31st Annual International Conference on the Theory and Applications of Cryptographic Techniques, April 2012, pp.554571. [33] Bresson E, Monnerat J, Vergnaud D. Separation results on the "onemore" computational problems. In Proc. the 2008 the Cryptographers' Track at the RSA Conference, April 2008, pp.7187. [34] Pass R. Limits of provable security from standard assumptions. In Proc. the 43rd ACM Symposium on Theory of Computing, June 2011, pp.109118. [35] Zhang J, Zhang Z, Chen Y, Guo Y, Zhang Z. Blackbox separations for onemore (static) CDH and its generalization. In Proc. the 20th Int. Conference on the Theory and Application of Cryptology and Information Security, December 2014, pp.366385. [36] Boneh D, Lynn B, Shacham H. Short signatures from the Weil pairing. In Proc. the 7th Int. Conference on the Theory and Application of Cryptology and Information Security, December 2001, pp.514532. [37] Abdalla M, Bellare M, Rogaway P. The Oracle DiffieHellman assumptions and an analysis of DHIES. In Proc. the 1st Cryptographer's Track at RSA Conference, April 2001, pp.143158. [38] Wang Y, Matsuda T, Hanaoka G, Tanaka K. Impossibility on tamperresilient cryptography with uniqueness properties. IACR ePrint Archive, 2018, 2018:Article No. 564. [39] Boneh D, Boyen X. Efficient selectiveID secure identitybased encryption without random oracles. In Proc. the 23rd Int. Conference on the Theory and Applications of Cryptographic Techniques, May 2004, pp.223238. [40] Katz J, Wang N. Efficiency improvements for signature schemes with tight security reductions. In Proc. the 10th ACM Conference on Computer and Communications Security, October 2003, pp.155164. [41] ElGamal T. A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans. Information Theory, 1985, 31(4):469472. 
[1]  Zhe Liu, Hwajeong Seo, Howon Kim. A Synthesis of MultiPrecision Multiplication and Squaring Techniques for 8Bit Sensor Nodes: StateoftheArt Research and Future Challenges [J]. , 2016, 31(2): 284299. 

