Multi-signature schemes have attracted considerable attention in recent years due to their popular applications in PoS blockchains. However, the use of general multi-signature schemes poses a critical threat to the se...
详细信息
ISBN:
(纸本)9781939133441
Multi-signature schemes have attracted considerable attention in recent years due to their popular applications in PoS blockchains. However, the use of general multi-signature schemes poses a critical threat to the security of PoS blockchains once signing keys get corrupted. That is, after an adversary obtains enough signing keys, it can break the immutable nature of PoS blockchains by forking the chain and modifying the history from some point in the past. Forward-secure multi-signature (FS-MS) schemes can overcome this issue by periodically updating signing keys. The only FS-MS construction currently available is Drijvers et al's Pixel, which builds on pairing groups and only achieves forward security at the time period level. In this work, we present new FS-MS constructions that either are free from pairing or capture forward security at the individual message level (i.e., fine-grained forward security). Our first construction Pixel+ works for a maximum number of time periods T. Pixel+ signatures consist of only one group element, and can be verified using two exponentiations. It is the first FS-MS from RSA assumption, and has 3.5x and 22.8x faster signing and verification than Pixel, respectively. Our second FS-MS construction Pixel++ is a pairing-based one. It immediately revokes the signing key's capacity of re-signing the message after creating a signature on this message, rather than at the end of the current time period. Thus, it provides more practical forward security than Pixel. On the other hand, Pixel++ is almost as efficient as Pixel in terms of signing and verification. Both Pixel+ and Pixel++ allow for non-interactive aggregation of signatures from independent signers and are proven to be secure in the random oracle model. In addition, they also support the aggregation of public keys, significantly reducing the storage overhead on PoS blockchains. We demonstrate how to integrate Pixel+ and Pixel++ into PoS blockchains. As a proof-of-concept, we prov
With the advancement of information technology and the increasing prevalence of the internet, the number of malware has experienced an exponential, and the security threat to users' property and privacy is becomin...
详细信息
Deep learning techniques have achieved significant improvements in malware analysis application, such as malware detection, malware classification and vulnerability mining. Convolutional neural network (CNN) is applie...
详细信息
Dynamic taint analysis is a widely used information flow analysis method. The software structure supporting dynamic taint analysis needs running program to monitor the spread of taint, which will bring a large running...
详细信息
It is difficult to fuzz the protocol because the format of network protocol is complex and often involves syntax and semantic constraints. Traditional fuzzing often makes a trade-off between the validity of protocol m...
详细信息
Utilizing NLP methods in malware classification or clustering applications is a hotspot in malware analysis. Binary malware embedding has become an important direction and basis for malware analysis. Existing binary m...
详细信息
1 Introduction In recent years,the Massively Parallel Computation(MPC)model has gained significant ***,most of distributed and parallel graph algorithms in the MPC model are designed for static graphs[1].In fact,the g...
详细信息
1 Introduction In recent years,the Massively Parallel Computation(MPC)model has gained significant ***,most of distributed and parallel graph algorithms in the MPC model are designed for static graphs[1].In fact,the graphs in the real world are constantly *** size of the real-time changes in these graphs is smaller and more *** graph algorithms[2,3]can deal with graph changes more efficiently[4]than the corresponding static graph ***,most studies on dynamic graph algorithms are limited to the single machine ***,a few parallel dynamic graph algorithms(such as the graph connectivity)in the MPC model[5]have been proposed and shown superiority over their parallel static counterparts.
The NumPy computational library, the most typical scientificcomputing library in Python, is generally limited to a single-node or multi-threaded CPU-only execution model. With the increasing size of datasets, the inc...
详细信息
User profile plays an important role in analyzing high influencers in the era of big data. For example, the profile can help the political strategists to scrutinize the performance of a candidate or party and overcome...
详细信息
With the rapid development of the Internet and the increasingly complex and diverse network environment, it is of great significance to quickly and accurately obtain the topology environment of the target network for ...
详细信息
暂无评论