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

2009 International Conference on Computational Intelligence and security, CIS 2009

作者： Tan, Zuowen School of Information Technology Jiangxi University of Finance and Economics Nanchang 330013 Jiangxi Province China Key Lab. of Network Security and Cryptology School of Mathematics and Computer Science Fujian Normal University Fuzhou 350007 Fujian Province China

ISBN: (纸本)9780769539317

In a group signature scheme, a group member signs messages anonymously on behalf of the group. However, in the case of a dispute, the actual group signer's identity can be revealed by a designated entity. In this paper, we propose a new identity-based group signature scheme using bilinear maps. The group signature scheme is well suited for large groups, i.e., the length of the groups public key and the length of signatures are independent on the size of the group. Our signature scheme is based on bilinear maps. Furthermore, a group member can sign many messages using the same key pair. Cryptanalysis shows that the proposed group signature scheme is secure under the computational Diffie Hellman problem called CDHP assumption. And it is also more efficient than previous ones satisfying these requirements. © 2009 IEEE.

关键词： Cryptography

来源：评论

学校读者我要写书评

暂无评论

Doubly-Recursive Block Markov Superposition Transmission: A Low-Complexity and Flexible Coding Scheme

Doubly-Recursive Block Markov Superposition Transmission: A ...

引用

作者： Zhao, Shancheng Ma, Xiao Huang, Qin Bai, Baoming College of Information Science and Technology Jinan University Guangzhou510632 China Guangdong Key Laboratory of Data Security and Privacy Preserving Guangzhou510632 China School of Data and Computer Science Sun Yat-sen University Guangzhou510275 China School of Electronic and Information Engineering Beihang University Beijing100083 China State Key Laboratory of ISN Xidian University Xi'an710071 China

In this paper, we introduce a novel method, called doubly-recursive block Markov superposition transmission (DrBMST), to construct high-performance spatially coupled codes. An important characteristic of DrBMST codes is that the degrees of the constraint nodes in their normal graphs are at most three. As a result, DrBMST codes can be decoded with low complexity. We first prove that the error probability of an enlarged DrBMST code ensemble can be made arbitrarily small under windowed maximum-likelihood decoding (MLD) by increasing the decoding window size. This result partially explains the superior performances of DrBMST codes. Then we propose to use the extrinsic information transfer (EXIT) chart analysis to estimate the iterative windowed decoding thresholds of DrBMST codes. The EXIT chart analyses show that, with such a simple structure, DrBMST codes are comparable to BMST codes with large encoding memories in terms of decoding thresholds. Finally, we carry out comparisons to validate the advantages of DrBMST codes in terms of error performances and decoding complexities. In particular, for a decoding latency of 20,000 bits, the DrBMST code performs better than the (4, 8)-regular spatially coupled low-density parity-check (SC-LDPC) code, but with lower computational complexity. Hence, DrBMST codes can be used in communication systems with limited computational resources. In addition, we show that DrBMST can be used to construct multiple-rate codes. © 2020 IEEE.

关键词： Convolutional codes

来源：评论

学校读者我要写书评

暂无评论

DarkSAM: Fooling Segment Anything Model to Segment Nothing 38

DarkSAM: Fooling Segment Anything Model to Segment Nothing

引用

38th Conference on Neural information Processing Systems, NeurIPS 2024

作者： Zhou, Ziqi Song, Yufei Li, Minghui Hu, Shengshan Wang, Xianlong Zhang, Leo Yu Yao, Dezhong Jin, Hai National Engineering Research Center for Big Data Technology and System China Services Computing Technology and System Lab China Cluster and Grid Computing Lab China Hubei Engineering Research Center on Big Data Security China Hubei Key Laboratory of Distributed System Security China School of Computer Science and Technology Huazhong University of Science and Technology China School of Cyber Science and Engineering Huazhong University of Science and Technology China School of Software Engineering Huazhong University of Science and Technology China School of Information and Communication Technology Griffith University Australia

Segment Anything Model (SAM) has recently gained much attention for its outstanding generalization to unseen data and tasks. Despite its promising prospect, the vulnerabilities of SAM, especially to universal adversarial perturbation (UAP) have not been thoroughly investigated yet. In this paper, we propose DarkSAM, the first prompt-free universal attack framework against SAM, including a semantic decoupling-based spatial attack and a texture distortion-based frequency attack. We first divide the output of SAM into foreground and background. Then, we design a shadow target strategy to obtain the semantic blueprint of the image as the attack target. DarkSAM is dedicated to fooling SAM by extracting and destroying crucial object features from images in both spatial and frequency domains. In the spatial domain, we disrupt the semantics of both the foreground and background in the image to confuse SAM. In the frequency domain, we further enhance the attack effectiveness by distorting the high-frequency components (i.e., texture information) of the image. Consequently, with a single UAP, DarkSAM renders SAM incapable of segmenting objects across diverse images with varying prompts. Experimental results on four datasets for SAM and its two variant models demonstrate the powerful attack capability and transferability of DarkSAM. Our codes are availab.e at: https://***/CGCL-codes/DarkSAM. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Global Convergence Guarantees of (A)GIST for a Family of Nonconvex Sparse Learning Problems

引用

IEEE Transactions on Cybernetics 2022年第5期52卷 3276-3288页

作者： Zhang, Hengmin Qian, Feng Shang, Fanhua Du, Wenli Qian, Jianjun Yang, Jian East China University of Science and Technology Key Laboratory of Advanced Control and Optimization for Chemical Processes of Ministry of Education School of Information Science and Engineering Shanghai200237 China Shanghai Institute of Intelligent Science and Technology Tongji University Shanghai200092 China Xidian University Key Laboratory of Intelligent Perception and Image Understanding of Ministry of Education School of Artificial Intelligence Xi'an710071 China Peng Cheng Laboratory Shenzhen518066 China Nanjing University of Science and Technology Pca Laboratory Key Lab. of Intelligent Percept. and Syst. for High-Dimensional Information of Ministry of Education Nanjing210094 China Nanjing University of Science and Technology Jiangsu Key Laboratory of Image and Video Understanding for Social Security School of Computer Science and Engineering Nanjing210094 China

In recent years, most of the studies have shown that the generalized iterated shrinkage thresholdings (GISTs) have become the commonly used first-order optimization algorithms in sparse learning problems. The nonconvex relaxations of the \ell _data -norm usually achieve better performance than the convex case (e.g., \ell _data -norm) since the former can achieve a nearly unbiased solver. To increase the calculation efficiency, this work further provides an accelerated GIST version, that is, AGIST, through the extrapolation-based acceleration technique, which can contribute to reduce the number of iterations when solving a family of nonconvex sparse learning problems. Besides, we present the algorithmic analysis, including both local and global convergence guarantees, as well as other intermediate results for the GIST and AGIST, denoted as (A)GIST, by virtue of the Kurdyka-Lojasiewica (KL) property and some milder assumptions. Numerical experiments on both synthetic data and real-world databases can demonstrate that the convergence results of objective function accord to the theoretical properties and nonconvex sparse learning methods can achieve superior performance over some convex ones. © 2013 IEEE.

关键词： Optimization

来源：评论

学校读者我要写书评

暂无评论

Autoregressive Model Based Smoothing Forensics Of Very Short Speech Clips

Autoregressive Model Based Smoothing Forensics Of Very Short...

引用

IEEE International Conference on Multimedia and Expo (ICME)

作者： Sanshuai Cui Enlei Li Xiangui Kang Guangdong Key Laboratory of Information Security Technology School of Data and Computer Science Sun Yat-Sen University China

ISBN: (数字)9781728113319

ISBN: (纸本)9781728113326

Smoothing is a post-processing widely used in speech tampering. Thus, we may determine whether a speech signal is original by smoothing forensics. However, in existing smoothing forensics methods, the detection performance of very short speech clips is much worse than that of long speech clips, and MP3 compression may lead to performance degradation, especially when the length of the smoothing window becomes small. Based on the observation that a very short speech clips can be considered as a stationary autoregressive (AR) process model, we proposed a robust smoothing forensics method of very short speech clips using the AR model coefficients. Experimental results on the TIMIT speech dataset demonstrate that the proposed method significantly outperforms the state-of-the-art method in terms of accuracy and robustness against various MP3 compression.

关键词： Filtering Smoothing methods Forensics Digital audio players Feature extraction Support vector machines databases

来源：评论

学校读者我要写书评

暂无评论

6G-Enabled Edge AI for Metaverse:Challenges, Methods,and Future Research Directions

引用

Journal of Communications and information Networks 2022年第2期7卷 107-121页

作者： Luyi Chang Zhe Zhang Pei Li Shan Xi Wei Guo Yukang Shen Zehui Xiong Jiawen Kang Dusit Niyato Xiuquan Qiao Yi Wu School of Data Science and Technology Heilongjiang UniversityHarbin 150080China Institute for Cryptology and Network Security Heilongjiang UniversityHarbin 150080China SenseTime Group Limited Shenzhen 518000China Pillar of Information Systems Technology and Design Singapore University of Technology and Design.Singapore 487372Singapore School of Automation.Guangdong University of Technology and Center for Intelligenl Batch Manufacturing based on IoT TechnologyGuangzhou 510006China School of Computer Science and Engineering Nanyang Technological UniversitySingapore 639798.Singapore State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications.Beijing 100876China

Sixth generation(6G)enabled edge intelligence opens up a new era of Internet of everything and makes it possible to interconnect people-devices-cloud anytime,*** and more next-generation wireless network smart service applications are changing our way of life and improving our quality of *** the hottest new form of next-generation Internet applications,Metaverse is striving to connect billions of users and create a shared world where virtual and reality ***,limited by resources,computing power,and sensory devices,Metaverse is still far from realizing its full vision of immersion,materialization,and *** this end,this survey aims to realize this vision through the organic integration of 6G-enabled edge artificial intelligence(AI)and ***,we first introduce three new types of edge-Metaverse architectures that use 6G-enabled edge AI to solve resource and computing constraints in *** we summarize technical challenges that these architectures face in Metaverse and the existing ***,we explore how the edge-Metaverse architecture technology helps Metaverse to interact and share digital ***,we discuss future research directions to realize the true vision of Metaverse with 6G-enabled edge AI.

关键词： edge artificial intelligence artificial intelli-gence 6G metaverse federated learning

来源：评论

学校读者我要写书评

暂无评论

Secure linear aggregation using decentralized threshold additive homomorphic encryption for federated learning

arXiv

引用

arXiv 2021年

作者： Tian, Haibo Zhang, Fangguo Shao, Yunfeng Li, Bingshuai The GuangDong Province Key Laboratory of Information Security Technology School of Data and Computer Science Sun Yat-Sen University Guangdong Guangzhou510275 China Huawei Noah's Ark Lab.

Secure linear aggregation is to linearly aggregate private inputs of different users with privacy protection. The server in a federated learning (FL) environment can fulfill any linear computation on private inputs of users through the secure linear aggregation. At present, based on pseudo-random number generator and one-time padding technique, one can efficiently compute the sum of user inputs in FL, but linear calculations of user inputs are not well supported. Based on decentralized threshold additive homomorphic encryption (DTAHE) schemes, this paper provides a secure linear aggregation protocol, which allows the server to multiply the user inputs by any coefficients and to sum them together, so that the server can build a full connected layer or a convolution layer on top of user inputs. The protocol adopts the framework of Bonawitz et al. to provide fault tolerance for user dropping out, and exploits a blockchain smart contract to encourage the server honest. The paper gives a security model, security proofs and a concrete lattice based DTAHE scheme for the protocol. It evaluates the communication and computation costs of known DTAHE construction methods. The evaluation shows that an elliptic curve based DTAHE is friendly to users and the lattice based version leads to a light computation on the server. Copyright © 2021, The Authors. All rights reserved.

关键词： Smart contract

来源：评论

学校读者我要写书评

暂无评论

One-Snapshot Face Anti-spoofing Using a Light Field Camera 12th

One-Snapshot Face Anti-spoofing Using a Light Field Camera

引用

12th Chinese Conference on Biometric Recognition, CCBR 2017

作者： Xie, Xiaohua Gao, Yan Zheng, Wei-Shi Lai, Jianhuang Zhu, Junyong School of Data and Computer Science Sun Yat-sen University Guangzhou China Guangdong Key Laboratory of Information Security Technology Sun Yat-sen University Guangzhou China Key Laboratory of Machine Intelligence and Advanced Computing Ministry of Education Sun Yat-sen University Guangzhou China

ISBN: (纸本)9783319699226

Face recognition is an increasingly popular technology for user authentication. However, face recognition is susceptible to spoofing attacks. Therefore, a reliable way to detect malicious attacks is crucial to the robustness of the face recognition system. This paper describes a new approach to utilizing light field camera for defending spoofing face attacks, like (warped) printed 2D facial photos and high-definition tablet images. The light field camera is a sensor that can record the directions as well as the colors of incident rays. Needing only one snapshot, multiple refocused images can be generated. In the proposed method, three kinds of features extracted from a pair of refocused images are extracted to discriminate fake faces and real faces. To verify the performance, we build a light field photograph databases and conduct experiments. Experimental results reveal that the employed features can achieve remarkable anti-spoofing accuracy under different types of spoofing attacks. © 2017, Springer International Publishing AG.

关键词： Face recognition

来源：评论

学校读者我要写书评

暂无评论

Detecting infeasible traces in process models

Detecting infeasible traces in process models

引用

14th International Conference on Enterprise information Systems, ICEIS 2012

作者： Wang, Zhaoxia Wen, Lijie Zhu, Xiaochen Liu, Yingbo Wang, Jianmin School of Software Tsinghua University Beijing 100084 China Department of Computer Science and Technology Tsinghua University Beijing 100084 China Key Lab. for Information System Security Ministry of Education Beijing 100084 China National Laboratory for Information Science and Technology Beijing 100084 China Logistical Engineering University Chongqing 400016 China

ISBN: (纸本)9789898565105

Workflow testing is an important method of workflow analysis in design time. A challenging problem with trace-oriented test data generation in particular and trace-based workflow analysis in general is the existence of infeasible traces for which there is no input data for them to be executed. In this paper we build on the theory of workflow nets and introduce workflow nets where transitions have conditions associated with them. We then demonstrate that we can determine which execution traces, that are possible according to the control-flow dependencies, are actually possible taking the data perspective into account. This way we are able to more accurately determine in design time the infeasible traces caused by the correlation between transition conditions along this trace. Finally, we provide a solution to automatically detecting the shortest infeasible trace.

关键词： Infeasible traces Process models Workflow analysis

来源：评论

学校读者我要写书评

暂无评论

Design of People Flow Monitoring System in Public Place based on MD-MCNN

Design of People Flow Monitoring System in Public Place base...

引用

2020 International Conference on 5G Mobile Communication and information science, MCIS-5G 2020

作者： Tianmin, Xiong Xiaochun, Lei Xingwen, Zheng Junyan, Chen Yizhou, Feng School of Computer and Information Security Guilin University of Electronic Technology Guilin541004 China Guangxi Colleges and Universities Key Lab. of Intelligent Processing of Computer Images and Graphics Guilin541004 China Guangxi Cooperative Innovation Center of Cloud Computing and Big Data Guilin University of Electronic Technology Guilin541004 China

Due to the limitation of hardware resources, the traditional people flow monitoring system based on computer vision in public places can't meet different crowd-scale scenarios. Therefore, a people flow monitoring system based on MD-MCNN algorithm is designed, which is an application system combining the improved SSD object detection algorithm MNSSD and MCNN density map regression algorithm. In the initial stage, the system uses MNSSD for accurate detection and counting. If the people flow gradually reaches a certain threshold, the system automatically uses MCNN to estimate people flow until the people flow falls below the threshold. Through the experimental verification, the system can realize the people flow statistics of low-density and high-density people in different scenarios, and can be applied on the existing embedded platform. This scheme can be extended to smart cities, smart scenic spots, smart transportation and other fields. © 2020 Published under licence by IOP Publishing Ltd.

关键词： Object detection

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：