检索结果-内蒙古大学图书馆

A straight-line extractable non-malleable commitment scheme

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2007年第7期E90A卷 1384-1394页

作者： Arita, Seiko Inst Informat Secur Yokohama Kanagawa 2210835 Japan

Non-malleability is an important security property of commitment schemes. The property means security against the man-in-the-middle attack, and it is defined and proved in the simulation paradigm using the corresponding simulator. Many known non-malleable commitment schemes have the common drawback that their corresponding simulators do not work in a straight-line manner, requires rewinding of the adversary. Due to this fact, such schemes are proved non-malleable only in the stand-alone cases. In the multiple-instances setting, i.e., when the scheme is performed concurrently with many instances of itself, such schemes cannot be proved non-malleable. The paper shows an efficient commitment scheme proven to be non-malleable even in the multiple-instances setting, based on the KEA1 and DDH assumptions. Our scheme has a simulator that works in a straight-line manner by using the KEA1-extractor instead of the rewinding strategy.

关键词： commitment scheme non-malleability the KEA1 assumption extractability

来源：评论

学校读者我要写书评

暂无评论

Lattice-Based commitment scheme for Low Communication Costs

引用

IEEE ACCESS 2024年 12卷 111400-111410页

作者： Miyaji, Hideaki Wang, Yuntao Miyaji, Atsuko Ritsumeikan Univ Coll Informat Sci & Technol Ibaraki Osaka 5678570 Japan Univ Electrocommun Grad Sch Informat & Engn Chofu Tokyo 1828585 Japan Osaka Univ Grad Sch Engn Suita Osaka 5650871 Japan

commitment schemes are cryptographic schemes that can be applied to zero-knowledge proof construction and blockchain construction. Recently, lattice-based cryptography has been intensively investigated due to the promising potential in quantum cryptography. Accordingly, commitment schemes based on lattice assumptions have been studied for practical applications. Notably, applications often require committing an arbitrary message with low communication costs, so commitment schemes must be satisfied with fewer length restrictions and fewer extensions to the messages. Several studies have been conducted to achieve the problem, including the study published by Baum et al. in 2018. However, the output length of their scheme is large in relation to the input length. We design a length-extension-free commitment scheme Com(MWM) in which the length of the message string is large relative to the length of the commitment string, improving on the commitment scheme of Baum et al. Furthermore, we prove that the hiding and binding properties of Com(MWM) are based on the hardness of the decisional search knapsack problem and extended search knapsack problems, respectively. Finally, we evaluate the computation costs of generating commitment value between ours and Baum et al.'s commitment scheme.

关键词： commitment scheme lattice-based protocol hiding property binding property AES-128 commitment scheme lattice-based protocol hiding property binding property AES-128

来源：评论

学校读者我要写书评

暂无评论

Non-interactive and Non-malleable commitment scheme Based on q-one Way Group Homomorphisms

引用

Journal of Shanghai Jiaotong university(Science) 2008年第5期13卷 574-578页

作者：张宗洋董晓蕾曹珍富 Computer Science & Engineering Department Shanghai Jiaotong University

commitment scheme is a basic component of many cryptographic protocols, such as coin-tossing, identification schemes, zero-knowledge and multi-party computation. In order to prevent man-in-middle attacks, non-malleability is taken into account. Many forming works focus on designing non-malleable commitments schemes based on number theory assumptions. In this paper we give a general framework to construct non- interactive and non-malleable commitment scheme with respect to opening based on more general assumptions called q-one way group homomorphisms (q-OWGH). Our scheme is more general since many existing commitment schemes can be deduced from our scheme.

关键词： commitment scheme non-malleable non-interactive q-one way group homomorphisms （q-OWGH）

来源：评论

学校读者我要写书评

暂无评论

Fuzzy commitment scheme based on Reed Solomon Codes 16

Fuzzy Commitment Scheme based on Reed Solomon Codes

引用

9th International Conference on Security of Information and Networks (SIN)

作者： Chauhan, Sonam Sharma, Ajay SRM Univ Delhi NCR Sonepat Haryana India

ISBN: (纸本)9781450347648

commitment scheme is the basic element of various cryptographic protocols. The fuzziness introduced in the fuzzy commitment scheme allows small amount of corruptions. The fuzzy commitment scheme based on the cryptographic hash functions suffers security imperfections. Thus, this paper presents a fuzzy commitment scheme with the Reed Solomon error correction codes which is capable of correcting t errors. The proposed scheme explores the different variables involved in the scheme and their effects on the execution time of the scheme.

关键词： Fuzzy commitment scheme (FCS) Fuzzy commitment Key (FCK) Error Correction Codes Reed Solomon Code commitment scheme

来源：评论

学校读者我要写书评

暂无评论

Message-Restriction-Free commitment scheme Based on Lattice Assumption 1

引用

16th International Conference on Information Security Practice and Experience (ISPEC)

作者： Miyaji, Hideaki Wang, Yuntao Miyaji, Atsuko Osaka Univ Grad Sch Engn Suita Osaka Japan Japan Adv Inst Sci & Technol Sch Informat Sci Nomi Japan

ISBN: (数字)9783030932060

ISBN: (纸本)9783030932053;9783030932060

A commitment scheme is a fundamental protocol and an essential component of basic cryptographic tasks, such as zero-knowledge identification. In recent years, lattice-based cryptography has been intensively studied owing to its potential to be promising post-quantum cryptography. Therefore, the commitment schemes based on lattice assumption have been studied for practical applications. Typically, many applications require to commit arbitrary vectors rather than only short ones. In order to send such large messages, one of a crucial challenges of commitment schemes is to increase the size of a message string. Various existing studies have been done to enlarge the size of a message string so far. Baum et al. constructed the commitment scheme, which can allow sending large message size in 2018. However, the domain available for message string is still being used for non-message purposes. In this paper, by improving Baum et al.'s commitment scheme, we propose a commitment scheme that can send a larger message size than Baum et al.'s message string size. Furthermore, we prove that the hiding property of our commitment scheme is based on the hardness of the decisional knapsack problem, and the binding property is based on the hardness of the module small-integer solution problem. We also show how to achieve a statistically hiding commitment scheme by setting appropriate parameters.

关键词： commitment scheme Hash function Lattice-based protocol

来源：评论

学校读者我要写书评

暂无评论

A verifiable scheme for differential privacy based on zero-knowledge proofs

引用

JOURNAL OF KING SAUD UNIVERSITY-COMPUTER AND INFORMATION SCIENCES 2025年第3期37卷 1-15页

作者： Wei, Jianqi Chen, Yuling Yang, Xiuzhang Luo, Yun Pei, Xintao Guizhou Univ State Key Lab Publ Big Data Guiyang 550025 Peoples R China Guizhou Univ Coll Comp Sci & Technol Guiyang 550025 Peoples R China

The protection of personal privacy has become a paramount issue in the field of data science, with its significance continuously rising. Differential privacy technology has garnered significant attention for its effectiveness in preserving individual privacy. However, the implementation of differential privacy relies on a degree of trust in the entities or individuals executing the algorithms. This paper proposes an innovative solution: a verifiable differential privacy mechanism based on zero-knowledge proofs. This approach integrates differential privacy with zero-knowledge proof technology to not only verify the correctness of the differential privacy techniques but also enhance the transparency and reliability of the algorithms. Additionally, we have designed a publicly verifiable data release scheme that integrates commitment mechanisms and range proofs, ensuring that the range of published data noise does not exceed predetermined thresholds, thereby ensuring the utility of the data. Compared to other verifiable differential privacy solutions, our approach is unique in that it does not rely on the number of participants but is solely dependent on the precision of the data. This means that our computational cost will not increase with the addition of more participants. Finally, we conducted a performance evaluation of the solution, which only took 700ms to complete a single verification. On average, there was a 6% reduction in expectation and a 40% reduction in variance, demonstrating the enhancement of its data utility and the feasibility and effectiveness in practical applications.

关键词： Differential privacy commitment scheme Zero-knowledge proofs Verifiable Data utility

来源：评论

学校读者我要写书评

暂无评论

Avoiding trusted setup in isogeny-based commitments

引用

DESIGNS CODES AND CRYPTOGRAPHY 2025年 1-19页

作者： Saah, Gustave Tchoffo Fouotsa, Tako Boris Fouotsa, Emmanuel Nkuimi-Jugnia, Celestin Univ Yaounde I Dept Math Yaounde Cameroon Univ Bamenda Ctr Cybersecur & Math Cryptol Bamenda Cameroon Ecole Polytech Fed Lausanne Lausanne Switzerland

In 2021, Sterner proposed a commitment scheme based on supersingular isogenies. For this scheme to be binding, one relies on a trusted party to generate a starting supersingular elliptic curve of unknown endomorphism ring. In fact, the knowledge of the endomorphism ring allows one to compute an endomorphism of degree a power of a given small prime. Such an endomorphism can then be split into two to obtain two different messages with the same commitment. This is the reason why one needs a curve of unknown endomorphism ring, and the only known way to generate such supersingular curves is to rely on a trusted party or on some expensive multiparty computation. We observe that if the degree of the endomorphism in play is well chosen, then the knowledge of the endomorphism ring is not sufficient to efficiently compute such an endomorphism and in some particular cases, one can even prove that endomorphism of a certain degree do not exist. Leveraging these observations, we adapt Sterner's commitment scheme in such a way that the endomorphism ring of the starting curve can be known and public. This allows us to obtain isogeny-based commitment schemes which can be instantiated without trusted setup requirements.

关键词： Supersingular isogenies Post-quantum cryptography Isogeny-based cryptography commitment scheme

来源：评论

学校读者我要写书评

暂无评论

Constructions and bounds for unconditionally secure non-interactive commitment schemes

引用

DESIGNS CODES AND CRYPTOGRAPHY 2002年第1-3期26卷 97-110页

作者： Blundo, C Masucci, B Stinson, DR Wei, R Univ Salerno Dipartimento Informat & Applicaz I-84081 Baronissi SA Italy Univ Waterloo Dept Combinator & Optimizat Waterloo ON N2L 3G1 Canada Lakehead Univ Dept Comp Sci Thunder Bay ON P7B 5E1 Canada

commitment schemes have been extensively studied since they were introduced by Blum in 1982. Rivest recently showed how to construct unconditionally secure non-interactive commitment schemes, assuming the existence of a trusted initializer. In this paper, we present a formal mathematical model for unconditionally secure non-interactive commitment schemes with a trusted initializer and analyze their binding and concealing properties. In particular, we show that such schemes cannot be perfectly binding: there is necessarily a small probability that Alice can cheat Bob by committing to one value but later revealing a different value. We prove several bounds on Alice's cheating probability, and present constructions of schemes that achieve optimal cheating probabilities. We also analyze a class of commitment schemes based on resolvable designs.

关键词： commitment scheme resolvable design

来源：评论

学校读者我要写书评

暂无评论

The Multireceiver commitment schemes

引用

Wuhan University Journal of Natural Sciences 2008年第6期13卷 759-764页

作者： WANG Shuhong QI Zhifeng Security Research Center Sumavision Technologies CO. LTD. Beijing 100085 China

Existing commitment schemes were addressed under the classic two-party scenario, However, popularity of the secure multi-party computation in today＇s lush network communication is motivating us to adopt more sophisticate commitment schemes. In this paper, we study for the first time multireceiver commitment in unconditionally secure setting, i.e., one committer promises a group of verifiers a common secret value （in computational setting it is trivial）. We extend the Rivest model for this purpose and present a provably secure generic construction using multireceiver authentication codes （without secrecy） as building blocks. Two concrete schemes are proposed as its immediate implementations, which are almost as efficient as an optimal MRA-code. We believe using other primitives to construct variants of this concept will open doors for more interesting research.

关键词： commitment scheme multi-party computation unconditional security authentication code verifiable secret sharing

来源：评论

学校读者我要写书评

暂无评论

New efficient non-malleable commitment schemes

New efficient non-malleable commitment schemes

引用

6th International Conference on Advanced Language Processing and Web Information Technology

作者： Dou Jiawei Li Shundong Beijing Architectural & Civil Engn Inst Dept Basic Sci Beijing 100044 Peoples R China Beijing Normal Univ Dept Comp Sci & Technol Beijing 100875 Peoples R China

ISBN: (纸本)9780769529301

Non-malleable commitment is recently one of research focuses in international cryptographic community. It has many important applications in e-commerce, and plays important role in constructing other cryptographic protocols. Most existing non-malleable commitment schemes are constructed by requiring that a committer proves, by zero-knowledge proof that he knows his committed secret. The attached Zero-knowledge proof process makes existing non-malleable commitments have higher computational and communication complexity More efficient schemes are appealing. This paper constructs three new efficient nonmalleable commitment schemes which do not require that a committer proves he knows his committed secret by zero-knowledge proof but rather require a committer proves, by other arguments, that he does know the secret at the same time he makes commitment. These non-malleable commitment schemes, without Zero-knowledge proof are much more efficient.

关键词： cryptography non-malleable commitment scheme

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：