A Universally-composable Secure Non-interactive Commitment Scheme

doi:10.3969/j.issn.1006-2475.2024.01.002

Abstract

Abstract:

Abstract： The commitment scheme is one of the most fundamental components in cryptography， and is the basis of many cryptographic protocols， such as zero-knowledge proof and secure multi-party computing protocols. Universally composability （UC） is of great significance in designing secure protocols， if a protocol is proven secure in the UC framework， it still maintains security even if it is executed concurrently with arbitrary （even insecure） protocols. Several current efficient UC commitment schemes are all interactive protocols， and non-interactive UC commitments have high computational cost and communication complexity of the protocol. Aiming at solving this problem， an efficient UC-secure non-interactive commitment scheme in the common reference string model is proposed. The key design idea of universally composable commitments are to achieve extractability and equivocability at the same time. A CCA2-secure encryption scheme is used to achieve extractability in the commitment phase. A non-interactive zero-knowledge proof is used in the decommitment phase， and a dual-model commitment scheme is utilized to maintain protocol equivocability. The proposed protocol reduces the multi-round communication to one round in the open phase， achieving the non-interactivity. Compared with the existing non-interactive commitment scheme， the cost of computation and communication are greatly reduced， and the efficiency of the protocol is improved.

Key words: Key words： UC-security, commitment schemes, non-interactivity, common reference string

CLC Number:

TP309

CAI Si-mu, WANG Li-bin. A Universally-composable Secure Non-interactive Commitment Scheme[J]. Computer and Modernization, 2024, 0(01): 6-12.

References

［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.

[1]	AO Bochao, FAN Bingbing. Federated Learning Aggregation Algorithm Based on AP Clustering Algorithm [J]. Computer and Modernization, 2024, 0(04): 5-11.
[2]	YU Lihui, HU Shaowen, HUANG Langxin, LUO Shuhuan. A Source Code Security Vulnerability Detection Method Using ChatGPT [J]. Computer and Modernization, 2024, 0(04): 88-91.
[3]	YANG Ju, DENG Zhiliang, YANG Zhiqiang, WANG Yan, ZHAO Zhongyuan. Decentralized Federation Learning Based on Fed-DPDOBO [J]. Computer and Modernization, 2024, 0(04): 99-106.
[4]	ZENG Zhong-jing-xin, GAN Gang. Side Channel Analysis Based on Convolutional Auto-encoder [J]. Computer and Modernization, 2024, 0(03): 110-114.
[5]	HAN Dong-song, SHA Le-tian, ZHAO Chuang-ye. Worm and Agent-based Attack Modeling for Industrial Control Systems [J]. Computer and Modernization, 2023, 0(10): 107-114.
[6]	YE Li-ming, CHEN Wei-wen. A Cascaded Insulator Defect Detection Model Combining Semantic Segmentation and Object Detection [J]. Computer and Modernization, 2023, 0(06): 82-88.
[7]	LIU Jun, YUAN Lin, FENG Zhi-shang, ZHANG Biao, LIU Chao. Efficient Healing Key Management Scheme for UAV Group [J]. Computer and Modernization, 2023, 0(06): 103-109.
[8]	ZHA Kai-jin, WANG Zhi-bo, HE Yue-shun, XU Hong-zhen. Survey on Blockchain Security Protection [J]. Computer and Modernization, 2023, 0(06): 110-117.
[9]	DENG Yin-juan, DU Hong-zhen, DOU Xiao-xia. Registered Users Public Key Searchable Encryption Scheme with Secure-channel Free [J]. Computer and Modernization, 2020, 0(09): 43-48.
[10]	DENG Ming-wei, OU Wei, YANG Jie. Safety Analysis of Three Classic Blockchain Consensus Mechanisms [J]. Computer and Modernization, 2020, 0(06): 34-.
[11]	ZHANG Xi, WANG Jian. A Public Integrity Auditing Scheme Based on Blind Signature for Shared Data in Cloud [J]. Computer and Modernization, 2020, 0(04): 60-.
[12]	WU Ke-he， CHEN Hong-xiang， LI Wei. Research on Beidou Secure Transport Protocol Based on SM9 Identity Password [J]. Computer and Modernization, 2020, 0(02): 41-.
[13]	ZHANG Yi, WANG Bo. Image Encryption Based on Fractional Rossler Chaotic Sequence [J]. Computer and Modernization, 2019, 0(12): 119-.
[14]	WEN Ting-ting, LI Hong-zhe. Elastic Load Balancing Algorithm for Cloud Computing Service [J]. Computer and Modernization, 2019, 0(10): 28-.
[15]	LI He-ting, FENG Ren-jun, CHEN Hai-yan, JING Dong-sheng. Intrusion Detection Based on Heterogeneous Convolutional Neural Network [J]. Computer and Modernization, 2019, 0(10): 117-.