[1] |
CANETTI R, FISCHLIN M. Universally composable commitments[C]// Advances in Cryptology-CRYPTO 2001. 2001:19-40.
|
[2] |
唐春明,刘卓军. 承诺方案的研究[J]. 系统科学与数学, 2008,28(8):961-970.
|
[3] |
DAMGÅRD I, NIELSEN J B. Perfect hiding and perfect binding universally composable commitment schemes with constant expansion factor[C]// Advances in Cryptology-CRYPTO 2002. 2002:581-596.
|
[4] |
CANETTI R, LINDELL Y, OSTROVSKY R, et al. Universally composable two-party and multi-party secure computation[C]// Proceedings of the 34th Annual ACM Symposium on Theory of Computing. 2002:494-503.
|
[5] |
张硕. 安全多方计算协议及其应用研究[D]. 北京:北京邮电大学, 2021.
|
[6] |
CANETTI R. Universally composable security: A new paradigm for cryptographic protocols[C]// Proceedings 42nd IEEE Symposium on Foundations of Computer Science. 2001:136-145.
|
[7] |
CANETTI R, JAIN A, SCAFURO A. Practical UC security with a global random oracle[C]// Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security. 2014:597-608.
|
[8] |
CASCUDO I, DAMGÅRD I, DAVID B, et al. Efficient UC commitment extension with homomorphism for free (and applications)[C]// International Conference on the Theory and Application of Cryptology and Information Security. 2019:606-635.
|
[9] |
LINDELL Y. Highly-efficient universally-composable commitments based on the DDH assumption[C]// Advances in Cryptology-EUROCRYPT 2011. 2011:446-466.
|
[10] |
BLAZY O, CHEVALIER C, POINTCHEVAL D, et al. Analysis and improvement of Lindell’s UC-secure commitment schemes[C]// International Conference on Applied Cryptography and Network Security. 2013:534-551.
|
[11] |
FUJISAKI E. Improving practical UC-secure commitments based on the DDH assumption[J]. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2022,105(3):182-194.
|
[12] |
ABDOLMALEKI B, BAGHERY K, LIPMAA H, et al. DL -extractable UC-commitment schemes[C]// International Conference on Applied Cryptography and Network Security. 2019:385-405.
|
[13] |
FISCHLIN M, LIBERT B, MANULIS M. Non-interactive and reusable universally composable string commitments with adaptive security[C]// Advances in Cryptology-ASIACRYPT 2011. 2011:468-485.
|
[14] |
DAMGARD I, GROTH J. Non-interactive and reusable non-malleable commitment schemes[C]// Proceedings of the 35th Annual ACM Symposium on Theory of Computing. 2003:426-437.
|
[15] |
ABDOLMALEKI B, KHOSHAKHLAGH H, SLAMANIG D. A framework for UC-secure commitments from publicly computable smooth projective hashing[C]// Proceedings of the 17th IMA International Conference on Cryptography and Coding. 2019:1-21.
|
[16] |
DAMGÅRD I. On Σ protocols[J]. Lecture Notes, 2002,56(2):62-84.
|
[17] |
FIAT A, SHAMIR A. How to prove yourself: Practical solutions to identification and signature problems[C]// Advances in Cryptology-CRYPTO 1986. 1986:186-194.
|
[18] |
LINDELL Y. An efficient transform from sigma protocols to NIZK with a CRS and non-programmable random Oracle[C]// Theory of Cryptography Conference. 2015:93-109.
|
[19] |
BONEH D, FRANKLIN M. Identity-based encryption from the Weil pairing[C]// Annual International Cryptology Conference. 2001:213-229.
|
[20] |
CRAMER R, SHOUP V. A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack[C]// Advances in Cryptology -CRYPTO 1998. 1998:13-25.
|
[21] |
CATALANO D, VISCONTI I. Hybrid commitments and their applications to zero-knowledge proof systems[J]. Theoretical Computer Science, 2007,374(1-3):229-260.
|
[22] |
BLUM M, FELDMAN P, MICALI S. Non-interactive zero-knowledge and its applications[M]// Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali. 2019:329-349.
|
[23] |
雷飞宇,陈克非. UC 安全多方计算模型及其典型应用研究[D]. 上海:上海交通大学, 2007.
|
[24] |
LINDELL Y. How to simulate it: A tutorial on the simulation proof technique[J]. Tutorials on the Foundations of Cryptography, 2017,66(1):277-346.
|
[25] |
LINDELL Y. Secure multiparty computation[J]. Communications of the ACM, 2020,64(1):86-96.
|
[26] |
CANETTI R. Security and composition of cryptographic protocols: A tutorial (part I)[J]. ACM SIGACT News, 2006,37(3):67-92.
|
[27] |
CASCUDO I, DAMGARD I, DAVID B, et al. Additively homomorphic UC commitments with optimal amortized overhead[C]// IACR International Workshop on Public Key Cryptography. 2015:495-515.
|
[28] |
HOFHEINZ D, MÜller-QUADE J. Universally composable commitments using random oracles[C]// Theory of Cryptography Conference. 2004:58-76.
|