中文
相关论文

相关论文: DSA Security Enhancement through Efficient Nonce G…

200 篇论文

In this paper GA based light weight faster version of Digital Signature Algorithm (GADSA) in wireless communication has been proposed. Various genetic operators like crossover and mutation are used to optimizing amount of modular…

密码学与安全 · 计算机科学 2012-08-14 Arindam Sarkar , J. K. Mandal

Domain Generation Algorithms (DGAs) are used by adversaries to establish Command and Control (C\&C) server communications during cyber attacks. Blacklists of known/identified C\&C domains are often used as one of the defense mechanisms.…

密码学与安全 · 计算机科学 2021-01-05 Ibrahim Yilmaz , Ambareen Siraj , Denis Ulybyshev

A novel signaling design for secure transmission over two-user multiple-input multiple-output non-orthogonal multiple access channel using deep neural networks (DNNs) is proposed. The goal of the DNN is to form the covariance matrix of…

信息论 · 计算机科学 2021-10-15 Jordan Pauls , Mojtaba Vaezi

Modern malware typically makes use of a domain generation algorithm (DGA) to avoid command and control domains or IPs being seized or sinkholed. This means that an infected system may attempt to access many domains in an attempt to contact…

密码学与安全 · 计算机科学 2019-06-24 Ryan R. Curtin , Andrew B. Gardner , Slawomir Grzonkowski , Alexey Kleymenov , Alejandro Mosquera

Randomness plays a vital role in numerous applications, including simulation, cryptography, distributed systems, and gaming. Consequently, extensive research has been conducted to generate randomness. One such method is to design a…

密码学与安全 · 计算机科学 2025-05-13 Pham Nhat Minh , Khuong Nguyen-An

Cryptographic algorithms and protocols often need unique random numbers as parameters (e.g. nonces). Failure to satisfy this requirement lead to vulnerable implementation and can result in security breach. We show how linear types and…

密码学与安全 · 计算机科学 2023-05-09 Richard Ostertág

Randomized smoothing is a general technique for computing sample-dependent robustness guarantees against adversarial attacks for deep classifiers. Prior works on randomized smoothing against L_1 adversarial attacks use additive smoothing…

机器学习 · 计算机科学 2021-06-14 Alexander Levine , Soheil Feizi

A graph-based sampling and consensus (GraphSAC) approach is introduced to effectively detect anomalous nodes in large-scale graphs. Existing approaches rely on connectivity and attributes of all nodes to assign an anomaly score per node.…

机器学习 · 计算机科学 2019-10-23 Vassilis N. Ioannidis , Dimitris Berberidis , Georgios B. Giannakis

Dynamic Searchable Encryption (DSE) has emerged as a solution to efficiently handle and protect large-scale data storage in encrypted databases (EDBs). Volume leakage poses a significant threat, as it enables adversaries to reconstruct…

密码学与安全 · 计算机科学 2024-03-05 Dongli Liu , Wei Wang , Peng Xu , Laurence T. Yang , Bo Luo , Kaitai Liang

Reaching agreement in the presence of arbitrary faults is a fundamental problem in distributed computation, which has been shown to be unsolvable if one-third of the processes can fail, unless signed messages are used. In this paper, we…

分布式、并行与集群计算 · 计算机科学 2021-12-20 Vicent Cholvi

This paper investigates the differentially private bipartite consensus algorithm over signed networks. The proposed algorithm protects each agent's sensitive information by adding noise with time-varying variances to the…

系统与控制 · 电气工程与系统科学 2023-04-04 Jimin Wang , Jieming Ke , Ji-Feng Zhang

In this paper, we propose a Fail-Stop Group Signature Scheme (FSGSS). FSGSS combines the features of the Group Signature and the Fail-Stop Signature to enhance the security level of the original Group Signature. Assuming that the FSGSS…

密码学与安全 · 计算机科学 2018-09-06 Yi-Yuan Chiang , Wang-Hsin Hsu , Wen-Yen Lin , Jonathan Jen-Rong Chen

With the growing realization that current Internet protocols are reaching the limits of their senescence, a number of on-going research efforts aim to design potential next-generation Internet architectures. Although they vary in maturity…

网络与互联网体系结构 · 计算机科学 2012-08-08 Paolo Gasti , Gene Tsudik , Ersin Uzun , Lixia Zhang

Self-Supervised Learning (SSL) has emerged as a significant paradigm in representation learning thanks to its ability to learn without extensive labeled data, its strong generalization capabilities, and its potential for privacy…

密码学与安全 · 计算机科学 2026-03-04 Jiayao Wang , Mohammad Maruf Hasan , Yiping Zhang , Xiaoying Lei , Jiale Zhang , Qilin Wu , Junwu Zhu , Dongfang Zhao

An increasing amount of processes are becoming automated for increased efficiency and safety. Common examples are in automotive, industrial control systems or healthcare. Automation usually relies on a network of sensors to provide key data…

密码学与安全 · 计算机科学 2021-08-10 Raoul Guiazon

AI-generated text (AIGT) detection evasion aims to reduce the detection probability of AIGT, helping to identify weaknesses in detectors and enhance their effectiveness and reliability in practical applications. Although existing evasion…

密码学与安全 · 计算机科学 2025-08-25 Yinghan Zhou , Juan Wen , Wanli Peng , Zhengxian Wu , Ziwei Zhang , Yiming Xue

Data centers increasingly host mutually distrustful users on shared infrastructure. A powerful tool to safeguard such users are digital signatures. Digital signatures have revolutionized Internet-scale applications, but current signatures…

密码学与安全 · 计算机科学 2024-06-12 Marcos K. Aguilera , Clément Burgelin , Rachid Guerraoui , Antoine Murat , Athanasios Xygkis , Igor Zablotchi

The goal of Domain Generation Algorithm (DGA) detection is to recognize infections with bot malware and is often done with help of Machine Learning approaches that classify non-resolving Domain Name System (DNS) traffic and are trained on…

密码学与安全 · 计算机科学 2021-10-13 Benedikt Holmes , Arthur Drichel , Ulrike Meyer

With meteoric developments in communication systems and data storage technologies, the need for secure data transmission is more crucial than ever. The level of security provided by any cryptosystem relies on the sensitivity of the private…

密码学与安全 · 计算机科学 2020-11-03 Unnikrishnan Menon , Anirudh Rajiv Menon , Atharva Hudlikar

We give a protocol for Asynchronous Distributed Key Generation (A-DKG) that is optimally resilient (can withstand $f<\frac{n}{3}$ faulty parties), has a constant expected number of rounds, has $\tilde{O}(n^3)$ expected communication…

分布式、并行与集群计算 · 计算机科学 2021-06-08 Ittai Abraham , Philipp Jovanovic , Mary Maller , Sarah Meiklejohn , Gilad Stern , Alin Tomescu