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

Robust Watermarking Based on Multi-layer Watermark Feature Fusion

IEEE Transactions on Multimedia 2025年

作者： Wu, Shaowu Lu, Wei Luo, Xiangyang Sun Yat-Sen University School of Computer Science and Engineering Ministry of Education Key Laboratory of Information Technology Guangdong Province Key Laboratory of Information Security Technology Guangzhou510006 China State Key Laboratory of Mathematical Engineering and Advanced Computing Henan450002 China

The purpose of robust image watermarking is to embed a watermark into a carrier image in an invisible form and extract the watermark successfully even under noise interference conditions to achieve copyright confirmation and traceability. Although watermarking methods based on deep learning can improve the robustness by adding a noise simulation layer, few theoretical analyses of the codec structure have been conducted. Theoretical explainability is the theoretical basis for developing a network architecture, which plays a guiding role in network development. On the basis of the interpretability of convolutional networks, this paper analyzes the mathematical process of embedding and extracting watermarks in codecs and proposes a novel watermarking framework based on multi-layer watermark feature fusion. Specifically, the encoder can be a convolutional network structure of arbitrary depth, whereas the decoder needs only to adopt its corresponding deconvolution structure. To improve the quality and robustness of the generated watermarked image, the watermark is associated with an arbitrary layer feature space in the decoder. In the decoder, the network quickly converges to each original encoding feature space through the deconvolution structure, thus decoupling the watermark features. Finally, the watermark is extracted via the automatic fusion of multi-layer watermark features. The experimental results show that the proposed method is suitable for few-shot learning, and its invisibility, robustness and generalization performance on multiple datasets are significantly better than those of other advanced methods. © 2025 IEEE.

关键词： Decoding

来源：评论

学校读者我要写书评

暂无评论

Pixel+ and Pixel++: compact and efficient forward-secure multi-signatures for PoS blockchain consensus 24

Pixel+ and Pixel++: compact and efficient forward-secure mul...

引用

Proceedings of the 33rd USENIX Conference on Security Symposium

作者： Jianghong Wei Guohua Tian Ding Wang Fuchun Guo Willy Susilo Xiaofeng Chen State Key Laboratory of Integrated Service Networks (ISN) Xidian University and State Key Laboratory of Mathematical Engineering and Advanced Computing State Key Laboratory of Integrated Service Networks (ISN) Xidian University College of Cyber Science Nankai University School of Computing and Information Technology University of Wollongong

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 *** 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 *** demonstrate how to integrate Pixel+ and Pixel++ into PoS blockchains. As a proof-of-concept, we provid

关键词：

来源：评论

学校读者我要写书评

暂无评论

Cooperative computing Techniques for a Deeply Fused and Heterogeneous Many-Core Processor Architecture

引用

Journal of Computer Science & Technology 2015年第1期30卷 145-162页

作者：郑方李宏亮吕晖过锋许晓红谢向辉 State Key Laboratory of Mathematical Engineering and Advanced Computing Wuxi 214125 China

Due to advances in semiconductor techniques, many-core processors have been widely used in high performance computing. However, many applications still cannot be carried out efficiently due to the memory wall, which has become a bottleneck in many-core processors. In this paper, we present a novel heterogeneous many-core processor architecture named deeply fused many-core （DFMC） for high performance computing systems. DFMC integrates management processing ele- ments （MPEs） and computing processing elements （CPEs）, which are heterogeneous processor cores for different application features with a unified ISA （instruction set architecture）, a unified execution model, and share-memory that supports cache coherence. The DFMC processor can alleviate the memory wall problem by combining a series of cooperative computing techniques of CPEs, such as multi-pattern data stream transfer, efficient register-level communication mechanism, and fast hardware synchronization technique. These techniques are able to improve on-chip data reuse and optimize memory access performance. This paper illustrates an implementation of a full system prototype based on FPGA with four MPEs and 256 CPEs. Our experimental results show that the effect of the cooperative computing techniques of CPEs is significant, with DGEMM （double-precision matrix multiplication） achieving an efficiency of 94%, FFT （fast Fourier transform） obtaining a performance of 207 GFLOPS and FDTD （finite-difference time-domain） obtaining a performance of 27 GFLOPS.

关键词： heterogeneous many-core processor data stream transfer register-level communication mechanism hardwaresynchronization technique processor prototype

来源：评论

学校读者我要写书评

暂无评论

A Note on "Constructing Bent Functions Outside the Maiorana-McFarland Class Using a General Form of Rothaus"

arXiv

引用

arXiv 2025年

作者： Guo, Fei Wang, Zilong Gong, Guang State Key Laboratory of Mathematical Engineering and Advanced Computing Information Engineering University Zhengzhou450001 China State Key Laboratory of Integrated Service Networks Xidian University Xi’an710071 China Department of Electrical and Computer Engineering University of Waterloo WaterlooONN2L 3G1 Canada

In 2017, Zhang et al. proposed a question (not open problem) and two open problems in [IEEE TIT 63 (8): 5336–5349, 2017] about constructing bent functions by using Rothaus’ construction. In this note, we prove that the sufficient conditions of Rothaus’ construction are also necessary, which answers their question. Besides, we demonstrate that the second open problem, which considers the iterative method of constructing bent functions by using Rothaus’ construction, has only a trivial solution. It indicates that all bent functions obtained by using Rothaus’ construction iteratively can be generated from the direct sum of an initial bent function and a quadratic bent function. This directly means that Zhang et al.’s construction idea makes no contribution to the construction of bent functions. To compensate the weakness of their work, we propose an iterative construction of bent functions by using a secondary construction in [DCC 88: 2007–2035, 2020]. © 2025, CC BY-NC-ND.

关键词： Hadamard transforms

来源：评论

学校读者我要写书评

暂无评论

Detection of Malicious PDF Files Using a Two-Stage Machine Learning Algorithm

引用

Chinese Journal of Electronics 2020年第6期29卷 1165-1177页

作者： HE Kang ZHU Yuefei HE Yubo LIU Long LU Bin LIN Wei State Key Laboratory of Mathematical Engineering and Advanced Computing

Portable document format(PDF) files are increasingly used to launch cyberattacks due to their popularity and increasing number of *** solutions have been developed to detect malicious files,but their accuracy decreases rapidly in face of new evasion *** explore how to improve the robustness of classifiers for detecting adversarial attacks in PDF *** replacement and the n-gram are implemented to extract robust features using proposed guiding *** the two-stage machine learning model,the objects are divided based on their types,and the anomaly detection model is first trained for each type *** former detection results are organized into tree-like information structure and treated as inputs to convolutional neural *** results show that the accuracy of our classifier is nearly 100% and the robustness against evasive samples is *** object features also enable the identification of different vulnerabilities exploited in malicious PDF files.

关键词： convolutional neural nets document handling feature extraction learning (artificial intelligence) pattern classification security of data trees (mathematics) robust feature extraction convolutional neural network tree-like information structure adversarial attack detection two-stage machine learning algorithm evasion techniques malicious files portable document format malicious PDF files classifier robustness anomaly detection model two-stage machine learning model Malicious PDF classification Robustness Guiding principles Two-stage classifier Convolutional neural network

来源：评论

学校读者我要写书评

暂无评论

Non-binary entanglement-assisted quantum stabilizer codes

引用

Science China(Information Sciences) 2017年第4期60卷 210-223页

作者： Lan LUO Zhi MA Zhengchao WEI Riguang LENG State Key Laboratory of Mathematical Engineering and Advanced Computing

In this paper, we present the pm-ary entanglement-assisted(EA) stabilizer formalism, where p is a prime and m is a positive integer. Given an arbitrary non-abelian "stabilizer", the problem of code construction and encoding is settled perfectly in the case of m = 1. The optimal number of required maximally entangled pairs is discussed and an algorithm to determine the encoding and decoding circuits is proposed. We also generalize several bounds on p-ary EA stabilizer codes, such as the BCH bound, the G-V bound and the linear programming bound. However, the issue becomes tricky when it comes to m > 1, in which case, the former construction method applies only when the non-commuting "stabilizer" satisfies a sophisticated limitation.

关键词： entanglement non-commutativity non-binary stabilizer codes quantum error-correction quantum circuits bounds

来源：评论

学校读者我要写书评

暂无评论

LaTLS: A Lattice-Based TLS Proxy Protocol

引用

Chinese Journal of Electronics 2022年第2期31卷 313-321页

作者： ZHANG Xinglong CHENG Qingfeng LI Yuting State Key Laboratory of Mathematical Engineering and Advanced Computing

The function of the Internet proxy is to check and convert the data exchanged between client and server. In fact, the two-party secure communication protocol with good security is turned into an unsafe multiparty protocol. At present, there are relatively few proxy protocols that can be applied in practice. This paper analyzes the classic agent protocol mcTLS and pointed out the security issues. We focus on the security of TLS 1.3 and proposed a lattice-based multi-party proxy protocol:La TLS. LaTLS can be proved secure in the eCK model, it can resist key-sharing attacks, counterfeiting attacks, replay attacks, and achieve forward security. Compared with traditional DH and ECDH schemes, LaTLS is more effcient. Its security is based on the shortest vector problem, therefor it has anti-quantum attack properties.

关键词： security issues Internet lattice-based multiparty proxy protocol relatively few proxy protocols data exchanged LaTLS key sharing attacks unsafe multiparty protocol Internet proxy shortest vector problem protocols antiquantum attack properties forward security two-party secure communication protocol classic agent protocol mcTLS classic agent protocol computer network security

来源：评论

学校读者我要写书评

暂无评论

A Further Understanding of Differential-Linear Cryptanalysis

引用

Chinese Journal of Electronics 2020年第4期29卷 660-666页

作者： REN Jiongjiong CHEN Shaozhen State Key Laboratory of Mathematical Engineering and Advanced Computing State Key Laboratory of Cryptology

Differential-linear cryptanalysis has attracted much attention since proposed to attack DES in 1994, and then some generalized theories are developed to complement and unify the ***, the links between differential-linear cryptanalysis and other important cryptanalysis methods have been still *** motivation is to fix the *** establishing some boolean equations, we propose the mathematical links among differential, linear and differential-linear *** then generalise the definition of capacity and present some properties of the capacity of differential *** links and properties are employed to explore the relationships between multidimensional differential-linear hulls and integral *** show that a multidimensional differential-linear hull of certain correlation always implies the existence of an integral distinguisher and a zero-correlation linear hull, while a special integral distinguisher indicates the existence of a multidimensional differential-linear hull.

关键词： Block cipher Differential cryptanalysis Linear cryptanalysis Differential-linear cryptanalysis Integral distinguisher Zero-correlation

来源：评论

学校读者我要写书评

暂无评论

Implementation of Positive Operator-Valued Measure in Passive Faraday Mirror Attack

引用

Communications in Theoretical Physics 2015年第3期63卷 296-302页

作者：王卫龙高明马智 State Key Laboratory of Mathematical Engineering and Advanced Computing

Passive Faraday-mirror(PFM) attack is based on imperfect Faraday mirrors in practical quantum cryptography systems and a set of three-dimensional Positive Operator-Valued Measure(POVM) operators plays an important role in this *** this paper,we propose a simple scheme to implement the POVM in PFM attack on an FaradayMichelson quantum cryptography *** the POVM can not be implemented directly with previous methods,in this scheme it needs to expand the states sent by Alice and the POVM operators in the attack into four-dimensional Hilbert space first,without changing the attacking effect by *** on the methods proposed by Ahnert and Payne,the linear-optical setup for implementing the POVM operators is *** last,the complete setup for realizing the PFM attack is presented with all ***,our scheme can also be applied to realize PFM attack on a plug-and-play system by changing the parameters in the setup.

关键词： Faraday mirrors passive Faraday mirror attack POVM linear optics

来源：评论

学校读者我要写书评

暂无评论

Low-power technologies in high-performance computer: trends and perspectives

引用

National Science Review 2016年第1期3卷 23-25页

作者： Xianghui Xie State Key Laboratory of Mathematical Engineering and Advanced Computing

INTRODUCTION With the breakdown of Dennard’s scaling rule,chip power for a given area size is not constant as transistors shrink from generation to generation[1].In particular,the power wall problem worsens with the ... 详细信息

关键词： HPC high trends and perspectives Low-power technologies in high-performance computer GPU CPU

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：