检索结果-南通市图书馆

verifiable secret sharing Scheme Based on the Plane Parametric Curve

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Applied Mathematics 2021年第11期12卷 1021-1030页

作者： Bin Li School of Mathematics Chengdu Normal University Chengdu China

verifiable secret sharing is a special kind of secret sharing. In this paper, A secure and efficient threshold secret sharing scheme is proposed by using the plane parametric curve on the basis of the principle of secret sharing. And the performance of this threshold scheme is analyzed. The results reveal that the threshold scheme has its own advantage of one-parameter representation for a master key, and it is a perfect ideal secret sharing scheme. It can easily detect cheaters by single operation in the participants so that the probability of valid cheating is less than 1/p (where p is a large prime).

关键词： Plane Parameter Curve Threshold Scheme verifiable secret sharing Cheater Information Rate Participating Members

Information-Theoretic Secure verifiable secret sharing over RSA Modulus

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Wuhan University Journal of Natural Sciences 2006年第6期11卷 1849-1852页

作者： QIU Gang WANG Hong WEI Shimin XIAO Guozhen State Key Laboratory of Integrated Sevice Network Xidian University Xi＇an 710071 Shaanxi China State Key Laboratory of Information Security Graduate University of Chinese Academy of Sciences Beijing 100049 China Department of Computer Science and Technology Huaibei Coal Normal College Huaibei 235000 Anhui China

The well-known non-interactive and information-theoretic secure verifiable secret sharing scheme presented by Pedersen is over a large prime. In this paper, we construct a novel non-interactive and information-theoretic verifiable secret sharing over RSA （Rivest, Shamir, Adleman） modulus and give the rigorous security proof. It is shown how to distribute a secret among a group such that any set of k parties get no information about the secret. The presented scheme is generally applied to constructions of secure distributed multiplication and threshold or forward-secure signature protocols.

关键词： verifiable secret sharing information-theoretic secure commitment RSA (Rivest, Shamir, Adleman) modulus

BDAE: A Blockchain-Based and Decentralized Attribute-Based Encryption Scheme for Secure Data sharing

在线全文

学校读者我要写书评

暂无评论

Wuhan University Journal of Natural Sciences 2024年第3期29卷 228-238页

作者： YANG Shuangxi School of Electronic Information Wuhan UniversityWuhan 430072HubeiChina

Ciphertext-policy attribute-based encryption(CP-ABE) is widely employed for secure data sharing and access control. However, its dependence on a single authority introduces security and performance challenges. Despite the existence of multi-authority CPABE approaches, persistent issues such as single points of failure and high computation cost on the user side remain. This study proposes a novel solution named blockchain-based and decentralized attribute-based encryption(BDAE) for data sharing. BDAE enhances traditional scheme by integrating blockchain and distributed key generation technology. The scheme employs an(n, t) threshold secret sharing algorithm, coupled with the Pedersen verifiable secret sharing method, for attribute key generation. This combination ensures key credibility,facilitates joint attribute management, and addresses single bottleneck and key verification issues. Integrated into a blockchain system, the scheme utilizes smart contracts for fine-grained access control and outsourced computing. Blockchain's decentralization and access logs make data sharing tamper-resistant and auditable. Moreover, simulation comparisons demonstrate that the scheme effectively reduces decryption overhead on the user side, meeting practical application requirements.

关键词： blockchain attribute-based encryption multi-authority verifiable secret sharing access control

A New Rational secret sharing Scheme

在线全文

学校读者我要写书评

暂无评论

China Communications 2010年第4期7卷 18-22页

作者： ZHANG En CAI Yongquan College of Computer Science and Technology Beijing University of Technology Beijing 100124 China College of Computer and Information Technology Henan Normal University Xinxiang 453007 China

In this paper,we propose a new approach for rational secret sharing in game theoretic *** trusted center is eliminated in the secret reconstruction *** player doesn’t know current round is real round or fake *** gain of following the protocol is more than the gain of deviating,so rational player has an incentive to abide the ***,every player can obtain the secret *** scheme is verifiable and any player’s cheating can not *** the proposed scheme is immune to backward induction and satisfies resilient *** player of the coalition C can do better,even if the whole coalition C *** scheme can withstand the conspiracy attack with at most m-1 players.

关键词： secret sharing Game Theory verifiable secret sharing Resilient Equilibrium

A verifiable privacy-preserving data collection scheme supporting multi-party computation in fog-based smart grid

在线全文

学校读者我要写书评

暂无评论

Frontiers of Computer Science 2022年第1期16卷 143-153页

作者： Zhusen LIU Zhenfu CAO Xiaolei DONG Xiaopeng ZHAO Haiyong BAO Jiachen SHEN Shanghai Key Laboratory of Trustworthy Computing East China Normal UniversityShanghai200062China Cyberspace Security Research Center Peng Cheng LaboratoryShenzhen518055China School of Computer Science and Information Engineering Zhejiang Gongshang UniversityHangzhou310018China

Incorporation of fog computing with low latency,preprocession(e.g.,data aggregation)and location awareness,can facilitate fine-grained collection of smart metering data in smart grid and promotes the sustainability and efficiency of the ***,much attention has been paid to the research on smart grid,especially in protecting privacy and data ***,most previous works do not focus on privacy-preserving data aggregation and function computation query on enormous data simultaneously in smart grid based on fog *** this paper,we construct a novel verifiable privacy-preserving data collection scheme supporting multi-party computation(MPC),named VPDC-MPC,to achieve both functions simultaneously in smart grid based on fog ***-MPC realizes verifiable secret sharing of users’data and data aggregation without revealing individual reports via practical cryptosystem and verifiable secret sharing ***,we propose an efficient algorithm for batch verification of share consistency and detection of error reports if the external adversaries modify the SMs’***,VPDC-MPC allows both the control center and users with limited resources to obtain arbitrary arithmetic analysis(not only data aggregation)via secure multi-party computation between cloud servers in smart ***,VPDC-MPC tolerates fault of cloud servers and resists *** also present security analysis and performance evaluation of our scheme,which indicates that even with tradeoff on computation and communication overhead,VPDC-MPC is practical with above features.

关键词： smart grid fog computing data aggregation verifiable secret sharing error detection secure multi-party computation secure function query privacy-preserving

A New Signature Scheme with Shared Verification

在线全文

学校读者我要写书评

暂无评论

The Journal of China Universities of Posts and Telecommunications 2006年第2期13卷 66-69页

作者： JIA Xiao-yun LUO Shou-shan YUAN Chao-wei School of Continuing Education Beijing University of Posts and Telecommunications Beijing 100876 P.R. China School of Software Engineering Beijing University of Posts and Telecommunications Beijing 100876 P.R. China National Key Laboratory of Integrated Service Networks Xidian University Xi'an 710071 P.R. China

With expanding user demands, digital signature techniques are also being expanded greatly, from single signature and single verification techniques to techniques supporting multi-users. This paper presents a new digital signature scheme with shared verification based on the fiat-shamir signature scheme. This scheme is suitable not only for digital signatures of one public key, but also for situations where multiple public keys are required. In addition, the scheme can resist all kinds of collusion, making it more practicable and safer. Additionally it is more efficient than other schemes.

关键词： digital signature shared verification verifiable secret sharing

An Anonymous Payment Protocol withMobile Agents in Hostile Environments

在线全文

学校读者我要写书评

暂无评论

Wuhan University Journal of Natural Sciences 2005年第1期10卷 271-274页

作者： LIUYi XIANGMing-sen WANGYu-min NationalKeyLaboratoryonIntegratedServerNetworks XidianUniversityXi＇an710071ShaanxiChina

By using Pedersen's verifiable secret sharing scheme and the theory of crossvalidation, we propose an a-nonymous payment protocol which have following features: protecting theconfidentiality of sensitive payment information from spying by malicioushosts; using a trustedthird party in a minimal way; verifying the validity of the share by the merchant; allowing agent toverify that the product which it is a-bout to receive is the one it is paying for; keeping thecustomer anonymous.

关键词： mobile agent anonymous payment protocol verifiable secret sharing thetheory of cross validation

Efficient Data Integrity Using Enhanced secret sharing Scheme for MANET

在线全文

学校读者我要写书评

暂无评论

Circuits and Systems 2016年第10期7卷 3174-3182页

作者： R. Mohandas Rengaraju K. Krishnamoorthi Department of Electronics and Communication Engineering Jayaram College of Engineering Trichy India Department of Electrical Engineering Sona College of Technology Salem India

Mobile Ad Hoc Networks consist of nodes which are wireless and get organized based on the transmission requirement. These nodes are mobile nodes, so they communicate with each other without any fixed access point. This type of network faces several attacks because of its mobility nature. In MANET, black hole attacks may cause packet dropping or misrouting of packets during transmission from sender to receiver. This may lead to performance degradation in the network. To surmount this issue, we propose the modified secret sharing scheme to provide the data protection from unauthorized nodes, consistency of data and genuineness. In this algorithm, initially the identification of black hole attacks is achieved and followed by data protection from malicious nodes and also this scheme checks for the reality of the data. Here, we detect the misbehaviour that is dropping or misrouting using verifiable secret sharing scheme. The proposed algorithm achieves the better packet delivery ratio, misbehaviour detection efficiency, fewer packets overhead and end-to-end delay than the existing schemes. These can be viewed in the simulation results.

关键词： MANET verifiable secret sharing Modified Proactive secret sharing Scheme End-to-End Delay Overhead Misbehaviour Detection Efficiency and Delivery Ratio

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