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

Continuous variable quantum signature algorithm

INTERNATIONAL JOURNAL OF QUANTUM INFORMATION 2007年第4期5卷 553-573页

作者： Zeng, Guihua Lee, Moonho Guo, Ying He, Guangqiang Shanghai Jiao Tong Univ Lab Coding & Commun Secur Shanghai 200030 Peoples R China Chonbuk Natl Univ Inst Informat & Commun Dept Informat & Commun Engn Chonju 561756 South Korea

A true quantum signature algorithm based on continuous-variable entanglement state is proposed. In the suggested algorithm, a key-pair, i.e. private signature key and public verification key, is generated based on a one-way function. By employing the signature key, a message state is encoded into a 2k-particle entangled state and a two-particle entangled state is prepared. The resulting states are exploited as a signature of the message state. The signature can be decoded under the verification key when it needs to be verified. Subsequently, a decoded message state and a two-particle entangled state are obtained. To compare the decoded states and the original states, a quantum circuit for comparing these states is exploited. Making use of measurement results of the quantum circuit one can judge the authenticity of the received signature. According to the security requirement of the signature scheme, the suggested algorithm has been proven to be theoretically secure by using the Shannon information theory.

关键词： cryptography signature algorithm entanglement quantum information

来源：评论

学校读者我要写书评

暂无评论

Performance Evaluation for the signature algorithm of ISDSR on Raspberry Pi 5

Performance Evaluation for the Signature Algorithm of ISDSR ...

引用

5th International Symposium on Computing and Networking (CANDAR)

作者： Kojima, Hideharu Yanai, Naoto Osaka Univ Grad Sch Informat Sci & Technol 1-5 Yamadaoka Suita Osaka Japan

ISBN: (纸本)9781538620878

Infrastructure monitoring systems, such as bridge, tunnel, railway, and so on, are applications which adopt wireless sensor networks (WSNs). Generally, a typical WSN consists of one sink node and sensor nodes. Each sensor node creates a route between itself and the sink node to send sensing data. If attackers succeed to inject fake data or fake route information during a process to create its route, critical problems may occur. For example, the sink node cannot collect sensing data, sensor nodes cannot receive commands from the sink node, and looped routes might be created. To prevent attackers from injecting fake route information, secure routing protocols with authentication tools, such as digital signatures, have been proposed. In this paper, we focus on ISDSR that is a multi hop secure routing protocol. ISDSR guarantees route information that contains a collection of nodes storing a travel path of the received packet. Sensor nodes need more computational processes to generate signatures and to verify signatures comparing with standard multi hop routing protocols, such as AODV and DSR, by applying secure routing protocols to WSNs. In order to run secure routing protocols on a sensor node, developers have to evaluate performances on low performance devices. How long do calculation times take to generate a signature and to verify a signature ? How many length of a generated signature does a packet need? To evaluate these performances on real devices, we implement both the signature algorithm of ISDSR as a multi-signature scheme and an RSA-based signature algorithm as a standard signature scheme on a Raspberry Pi. Then, we conduct experiments to measure round trip times including calculation times between two nodes and packet sizes.

关键词： Routing protocols Wireless sensor networks Public key Performance evaluation Digital signatures Aggregates Sensors signature algorithm digital signatures Performance Evaluation Public key Routing protocols Wireless sensor networks Sensors Secure Routing Protocol signatures Attackers Packet travel path Ganglia

来源：评论

学校读者我要写书评

暂无评论

RankSign: An Efficient signature algorithm Based on the Rank Metric

RankSign: An Efficient Signature Algorithm Based on the Rank...

引用

6th International Workshop on Post-Quantum Cryptography (PQCrypto)

作者： Gaborit, Philippe Ruatta, Olivier Schrek, Julien Zemor, Gilles Univ Limoges XLIM DMI 123 Av Albert Thomas F-87060 Limoges France Univ Bordeaux Inst Math emat UMR 5251 Bordeaux France

ISBN: (纸本)9783319116594;9783319116587

In this paper we propose a new approach to code-based signatures that makes use in particular of rank metric codes. When the classical approach consists in finding the unique preimage of a syndrome through a decoding algorithm, we propose to introduce the notion of mixed decoding of erasures and errors for building signature schemes. In that case the difficult problem becomes, as is the case in lattice-based cryptography, finding a preimage of weight above the Gilbert-Varshamov bound (case where many solutions occur) rather than finding a unique preimage of weight below the Gilbert-Varshamov bound. The paper describes RankSign: a new signature algorithm for the rank metric based on a new mixed algorithm for decoding erasures and errors for the recently introduced Low Rank Parity Check (LRPC) codes. We explain how it is possible (depending on choices of parameters) to obtain a full decoding algorithm which is able to find a preimage of reasonable rank weight for any random syndrome with a very strong probability. We study the semantic security of our signature algorithm and show how it is possible to reduce the unforgeability to direct attacks on the public matrix, so that no information leaks through signatures. Finally, we give several examples of parameters for our scheme, some of which with public key of size 11, 520 bits and signature of size 1728 bits. Moreover the scheme can be very fast for small base fields.

关键词： post-quantum cryptography signature algorithm code-based cryptography rank metric

来源：评论

学校读者我要写书评

暂无评论

Key-Insulated Undetachable Digital signature Scheme and Solution for Secure Mobile Agents in Electronic Commerce

引用

MOBILE INFORMATION SYSTEMS 2016年第Pt.3期2016卷 1-18页

作者： Shi, Yang Lin, Jie Xiong, Guoyue Wang, Xiaoping Fan, Hongfei Tongji Univ Sch Software Engn 4800 Caoan Highway Shanghai 201804 Peoples R China Tongji Univ Sch Econ & Management 4800 Caoan Highway Shanghai 201804 Peoples R China Tongji Univ Dept Comp Sci & Technol 4800 Caoan Highway Shanghai 201804 Peoples R China

Considering the security of both the customers' hosts and the eShops' servers, we introduce the idea of a key-insulated undetachable digital signature, enabling mobile agents to generate undetachable digital signatures on remote hosts with the key-insulated property of the original signer's signing key. From the theoretical perspective, we provide the formal definition and security notion of a key-insulated undetachable digital signature. From the practical perspective, we propose a concrete scheme to secure mobile agents in electronic commerce. The scheme is mainly focused on protecting the signing key from leakage and preventing the misuse of the signature algorithm on malicious servers. Agents do not carry the signing key when they generate digital signatures on behalf of the original signer, so the key is protected on remote servers. Furthermore, if a hacker gains the signing key of the original signer, the hacker is still unable to forge a signature for any time period other than the key being accessed. In addition, the encrypted function is combined with the original signer's requirement to prevent the misuse of signing algorithm. The scheme is constructed on gap Diffie-Hellman groups with provable security, and the performance testing indicates that the scheme is efficient.

关键词： Secure Scheme Solution electronic commerce Computer Hackers Performance Tests Solutions signature algorithm digital signatures Mobile agents Servers provable security

来源：评论

学校读者我要写书评

暂无评论

Toward conditionally anonymous Bitcoin transactions: A lightweight-script approach

引用

INFORMATION SCIENCES 2020年 509卷 290-303页

作者： Li, Lun Liu, Jiqiang Chang, Xiaolin Liu, Tianhao Liu, Jingxian Beijing Jiaotong Univ Beijing Key Lab Secur & Privacy Intelligent Trans 3 Shangyuancun Beijing 100044 Peoples R China Beijing Jiaotong Univ Sch Comp & Informat Technol 3 Shangyuancun Beijing 100044 Peoples R China

Bitcoin is being explored for applications in various Internet of Things (IoT) scenarios as a peer-to-peer payment platform. However, security and anonymity problems exist with Bitcoin, which threaten vulnerable IoT facilities. This paper aims to achieve conditional anonymity inside Bitcoin transactions. We first propose an identity-based conditionally anonymous signature (ICAS) algorithm and then design a lightweight Bitcoin script scheme (named pay-to-public-key-hash-with-conditional-anonymity or P2PKHCA), which applies the ICAS algorithm to make conditionally anonymous Bitcoin transactions. P2PKHCA allows the identity manager to trace the real identity of users while preserving users anonymity. Furthermore, P2PKHCA is backward compatible in terms of being able to work seamlessly with the existing Bitcoin script scheme pay-to-public-key-hash (P2PKH) in the Bitcoin network. We conduct a security analysis to verify the security features of P2PKHCA and employ a performance evaluation in terms of the cryptographic time and space costs by comparison with P2PKH. The simulation results demonstrate the effectiveness of P2PKHCA in reducing both time cost and data size. (C) 2019 Elsevier Inc. All rights reserved.

关键词： Conditional anonymity Bitcoin Privacy-preserving Internet of Things signature algorithm

来源：评论

学校读者我要写书评

暂无评论

AnonymousFox: An Efficient and Scalable Blockchain Consensus algorithm

引用

IEEE INTERNET OF THINGS JOURNAL 2022年第23期9卷 24236-24252页

作者： Wan, Ji Hu, Kai Li, Jie Su, Hao Beihang Univ State Key Lab Software Dev Environm Beijing 100190 Peoples R China

Blockchain is an innovative application of distributed storage, consensus algorithm, encryption algorithm, and other computer technologies. The consensus algorithm is the key to keep consistent among blockchain nodes. In most existing consensus algorithms, the leader node is responsible for proposing new block and communicating with other nodes. The leader node is easy to be the target of malicious attackers. With the increase of the number of nodes, the throughput and scalability of the blockchain system are also unsatisfactory. To address such issues, we propose the AnonymousFox consensus algorithm, which is suitable for the consortium blockchain and private blockchain. First, we design an anonymous leader node sorting algorithm, which hides the identity of the leader node through a variety of encryption algorithms. It periodically changes the ordered leader list to hide the target of malicious attackers. In addition, we design a consensus algorithm based on the anonymous identity of the leader node. Through one-to-many message communication, the amount of messages is greatly reduced. The complexity of the algorithm is O(n). It solves the problem of ordered replication of state machines when the leader node is anonymous. We analyze the algorithm, it ensures safety and liveness when the fault nodes are less than one-third of the total. We evaluate the throughput, latency, scalability, resource consumption, exception processing, smart contract, and blockchain network through experiments. The throughput of the proposed algorithm is 49.3% higher than that of the practical Byzantine fault tolerance (PBFT) algorithm. The experimental results show that the proposed algorithm has high performance and scalability.

关键词： Blockchain Byzantine fault tolerance (BFT) consensus algorithm distributed systems signature algorithm

来源：评论

学校读者我要写书评

暂无评论

ALMOST SURE CONVERGENCE OF A DECREASING GAIN SIGN algorithm FOR ADAPTIVE FILTERING

引用

IEEE TRANSACTIONS ON ACOUSTICS SPEECH AND SIGNAL PROCESSING 1988年第10期36卷 1669-1671页

作者： EWEDA, E Military Technical College Kobry El Kobba Cairo Egypt

The convergence analysis of a sign algorithm with decreasing gain, when governing the weights of an adaptive filter, is presented. The analysis is done in a noiseless case. A rigorous proof of almost-sure convergence to the optimal filter is attained under a weak-ergodicity assumption that includes the case, important in practice, of correlated observations.

关键词： Converge signature algorithm optimal filters algorithms adaptive filters Gain

来源：评论

学校读者我要写书评

暂无评论

Cryptanalysis of Wang's original and revised digital signature scheme

引用

ELECTRONICS LETTERS 2001年第4期37卷 220-220页

作者： Dai, ZD Yang, JH Ye, DF Gong, G Acad Sinica Grad Sch State Key Lab Informat Secur Beijing 100039 Peoples R China Univ Waterloo Dept Elect & Comp Engn Waterloo ON N2L 3G1 Canada Acad Sinica Inst Software Beijing 100080 Peoples R China

Wang's basic digital signature scheme and its new variation is cracked. The proposed signature forging algorithm makes no assumptions on operations of the schemes and is as efficient as the signing algorithm.

关键词： Forged Scheme digital signatures CRYPTANALYSIS signature algorithm

来源：评论

学校读者我要写书评

暂无评论

Leakage Prevention Method for Unstructured Data Based on Classification 6th

Leakage Prevention Method for Unstructured Data Based on Cla...

引用

6th International Conference on Applications and Techniques in Information Security (ATIS)

作者： Li, Hao Peng, Zewu Feng, Xinyao Ma, Hongxia Guangdong Power Grid Corp Informat Ctr Guangzhou Guangdong Peoples R China Chinese Acad Sci Inst Informat Engn SKLOIS Beijing Peoples R China

ISBN: (纸本)9783662486832;9783662486825

There is often a lot of sensitive information in the unstructured data of enterprise information network, if not controlled, the sensitive data will flow from the Intranet to the Extranet, which can easily lead to disclosure of corporate information assets, causing serious damage to enterprises. This paper combines the methods of keyword filtering and data label to protect the unstructured data in the corporate data assets based on grading and classification. It is an effective solution to the problem of data leakage, and can greatly reduce false positives in the information protection process, finally improve the accuracy of unstructured data protection. It uses the ElGamal signature algorithm to generate a digital label. Only those people with sensitivity level of keys can make tags with a sensitivity level of document, others cannot replace digital label. At the same time, the network protection server only needs to use the corresponding public key to verify the signature without knowing the private key, thereby effectively ensuring the security of the system.

关键词： Keyword filtering Data labels signature algorithm

来源：评论

学校读者我要写书评

暂无评论

Quantum algorithm for Polynomial Root Finding Problem 10

Quantum Algorithm for Polynomial Root Finding Problem

引用

10th International Conference on Computational Intelligence and Security CIS 2014

作者： Sun, Guodong Su, Shenghui Xu, Maozhi Beijing Univ Technol Coll Comp Sci Beijing Peoples R China Peking Univ Sch Math Sci Beijing Peoples R China

ISBN: (纸本)9781479974344

Quantum computation is a new computing model based on fundamental quantum mechanical principle. Grover's algorithm finds the solution for a searching problem in the square root time of exhaustive search. Brassard, Hoyer, Tapp's algorithm counts the number of solutions for a searching problem. Through exploiting the two quantum algorithms, we propose a quantum algorithm for solving a new cryptography problem----polynomial root finding problem, which could be used to design a cryptosystem. The algorithm will take O(root M/t) steps for finding one of the t solutions to the problem, where M is the modular of the equation. The success rate of the algorithm is a constant and the cost of the algorithm depends on the calculations of modular exponentiation and the number of iterations.

关键词： Polynomial root finding problem Quantum searching Quantum counting signature algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：