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

IEEE/AIAA 42nd Digital Avionics Systems Conference (DASC)

作者： Reinhart, Johannes Luettig, Bastian Huber, Nicolas Liedtke, Julian Annighoefer, Bjoern Univ Stuttgart Inst Aircraft Syst Stuttgart Germany Univ Stuttgart Inst Informat Secur Stuttgart Germany

ISBN: (纸本)9798350333572

Safety-critical digital systems such as Fly-by-wire control have demanding integrity and availability requirements which significantly exceed the occurrence rates of random hardware faults observed in digital computers. As a result, system designers need to employ reliable fault detection and mitigation techniques. Until now, the only method to achieve sufficiently reliable fault detection for systems that can cause hazardous or catastrophic events, is to replicate computer lanes and detect faults by comparing outputs. However, this comes with a large overhead in development cost, computing resources and additional requirements towards the application. We propose to apply a novel cryptographic technique to reliably detect faults and thereby assure integrity of avionics computers: Succinct Non-Interactive Arguments of Knowledge allow components to quickly verify computations without repeating the computation. We present a novel concept for building high-integrity avionics systems and set up a laboratory demonstrator for a simplified pitch control system. Our major results include the successful demonstration of the first self-proving and self-verifying cyber-physical system in a laboratory environment.

关键词： Fault Detection Integrity Safety Succinct Non-Interactive Argument of Knowledge Systems Architectures verifiable computing

来源：评论

学校读者我要写书评

暂无评论

A verifiable computing Scheme for Encrypted Control Systems

引用

IEEE CONTROL SYSTEMS LETTERS 2024年 8卷 1096-1101页

作者： Stabile, Francesca Lucia, Walter Youssef, Amr Franze, Giuseppe Univ Calabria DIMEG I-87036 Arcavacata Di Rende Italy Concordia Univ Concordia Inst Informat Syst Engn Montreal PQ H3G 2W1 Canada

The proliferation of cloud computing technologies has paved the way for deploying networked encrypted control systems, offering high performance, remote accessibility and privacy. However, in scenarios where the control algorithms run on third-party cloud service providers, the control's logic might be changed by a malicious agent on the cloud. Consequently, it is imperative to verify the correctness of the control signals received from the cloud. Traditional verification methods, like zero-knowledge proof techniques, are computationally demanding in both proof generation and verification, may require several rounds of interactions between the prover and verifier and, consequently, are inapplicable in real-time control system applications. In this letter, we present a novel computationally inexpensive verifiable computing solution inspired by the probabilistic cut-and-choose approach. The proposed scheme allows the plant's actuator to validate the computations accomplished by the encrypted cloud-based networked controller without compromising the control scheme's performance. We showcase the effectiveness and real-time applicability of the proposed verifiable computation scheme using a remotely controlled Khepera-IV differential-drive robot.

关键词： Cryptography Cloud computing Vectors Actuators Probabilistic logic Real-time systems Protocols verifiable computing cloud-based control encrypted control

来源：评论

学校读者我要写书评

暂无评论

verifiable computing Applications in Blockchain

引用

IEEE ACCESS 2021年 9卷 156729-156745页

作者： Simunic, Silvio Bernaca, Dalen Lenac, Kristijan Univ Rijeka Fac Engn Rijeka 51000 Croatia Univ Rijeka Ctr Artificial Intelligence & Cybersecur Rijeka 51000 Croatia

From weak clients outsourcing computational tasks to more powerful machines, to distributed blockchain nodes needing to agree on the state of the ledger in the presence of adversarial nodes, there is a growing need to efficiently verify the results of computations delegated to untrusted third parties. verifiable computing is a new and interesting research area that addresses this problem. Recently, new applications of verifiable computing techniques have emerged in blockchain technology for secure key management, sybil-resistance and distributed consensus, and smart contracts, while providing desired performance and privacy guarantees. In this paper, we provide an overview of common methods for verifying computation and present how they are applied to blockchain technology. We group the presented verifiable computing applications into five main application areas, i.e., multiparty approval for secure key management, sybil-resistance and consensus, smart contracts and oracles, scalability, and privacy. The main contribution of this survey is to answer two research questions: 1) what are the main application areas of verifiable computing in blockchain technology, and 2) how are verifiable computing techniques used in major blockchain projects today.

关键词： Blockchains Public key Privacy Peer-to-peer computing Elliptic curves Digital signatures Smart contracts verifiable computing blockchain zero-knowledge proof verifiable random function multiparty computation trusted execution environment smart contract privacy

来源：评论

学校读者我要写书评

暂无评论

VeriBlock: A novel blockchain framework based on verifiable computing and trusted execution environment

VeriBlock: A novel blockchain framework based on verifiable ...

引用

International Conference on COMmunication Systems and NETworkS (COMSNETS)

作者： Maddali, Lakshmi Padmaja Thakur, Meena Singh Dilip Vigneswaran, R. Rajan, M. A. Kanchanapalli, Srujana Das, Batsayan TCS Res & Innovat Mumbai Maharashtra India

ISBN: (纸本)9781728131870

Many enterprise (permissioned) blockchain applications demand low latency to commit their transactions on the ledger. One way to reduce latency is by reducing the number of peers required to execute/endorse a transaction in a secure and consistent way. However, by reducing the number of endorsements, blockchain network can be vulnerable to attacks such as collusion. In this paper, we introduce a novel scheme VeriBlock to overcome this problem. Our idea is to reduce the redundant execution of smart contracts without compromising on the security of the blockchain system by leveraging verifiable computing (VC) (which provides mathematically verifiable proof of execution) and Trusted Execution Environment (TEE) (which provides an attestation of the code executed) approaches. We also implemented these approaches to derive insights. In the proposed scheme, few nodes execute the smart contact logic and all the other nodes verify it. We propose two different models in the proposed scheme, 1. Endorser-Verify model, where the verification is done as part of transaction endorsement, and 2. Committer-Verify model, where the verification is done at the time of transaction commit. We have built Endorser-Verify model using Hyperledger Fabric blockchain platform, Pinocchio and Intel SGX as VC and TEE respectively and performance of the proposed scheme is analyzed by running bidding use case. Based on the results, we observe that the running time for VC based technique is in the order of magnitude two when compared with the naive implementation. On the other hand the performance of SGX is better than VC based approach.

关键词： Blockchain verifiable computing Trusted Execution Environment and Consensus

来源：评论

学校读者我要写书评

暂无评论

computing Neural Networks with Homomorphic Encryption and verifiable computing 2nd

Computing Neural Networks with Homomorphic Encryption and Ve...

引用

18th International Conference on Applied Cryptography and Network Security (ACNS)

作者： Madi, Abbass Sirdey, Renaud Stan, Oana CEA LIST Point Courrier 172 F-91191 Gif Sur Yvette France

ISBN: (纸本)9783030616380;9783030616373

The widespread use of machine learning and in particular of Artificial Neural Networks (ANN) raises multiple security and data privacy issues. Recent works propose to preserve data confidentiality during the inference process, available as an outsourced service, using Homomorphic Encryption techniques. However, their setting is based on an honest-but-curious service provider and none of them addresses the problem of result integrity. In this paper, we propose a practical framework for privacy-preserving predictions with Homomorphic Encryption (HE) and verifiable computing (VC). We propose here a partially encrypted Neural Network in which the first layer consists of a quadratic function and its homomorphic evaluation is checked for integrity using a VC scheme which is slight adaption of the one of Fiore et al. [13]. Inspired by the neural network model proposed by Ryffel et al. [26] which combines adversarial training and functional encryption for partially encrypted machine learning, our solution can be deployed in different application contexts and provides additional security guarantees. We validate our work on the MNIST handwritten recognition dataset for which we achieve high accuracy (97.54%) and decent latency for a practical deployment (on average 3.8 s for both homomorphic evaluation and integrity proof preparation and 0.021 s for the verification).

关键词： Neural Networks Homomorphic Encryption verifiable computing

来源：评论

学校读者我要写书评

暂无评论

Adaptive verifiable Coded computing: Towards Fast, Secure and Private Distributed Machine Learning 36

Adaptive Verifiable Coded Computing: Towards Fast, Secure an...

引用

36th IEEE International Parallel and Distributed Processing Symposium (IEEE IPDPS)

作者： Tang, Tingting Ali, Ramy E. Hashemi, Hanieh Gangwani, Tynan Avestimehr, Salman Annavaram, Murali Univ Southern Calif Comp Sci Dept Los Angeles CA 90007 USA Univ Southern Calif Elect Engn Dept Los Angeles CA 90007 USA

ISBN: (纸本)9781665481069

Stragglers, Byzantine workers, and data privacy are the main bottlenecks in distributed cloud computing. Some prior works proposed coded computing strategies to jointly address all three challenges. They require either a large number of workers, a significant communication cost or a significant computational complexity to tolerate Byzantine workers. Much of the overhead in prior schemes comes from the fact that they tightly couple coding for all three problems into a single framework. In this paper, we propose Adaptive verifiable Coded computing (AVCC) framework that decouples the Byzantine node detection challenge from the straggler tolerance. AVCC leverages coded computing just for handling stragglers and privacy, and then uses an orthogonal approach that leverages verifiable computing to mitigate Byzantine workers. Furthermore, AVCC dynamically adapts its coding scheme to trade-off straggler tolerance with Byzantine protection. We evaluate AVCC on a compute-intensive distributed logistic regression application. Our experiments show that AVCC achieves up to 4.2x speedup and up to 5.1% accuracy improvement over the state-of-the-art Lagrange coded computing approach (LCC). AVCC also speeds up the conventional uncoded implementation of distributed logistic regression by up to 7.6x, and improves the test accuracy by up to 12.1%.

关键词： coded computing verifiable computing machine learning straggler mitigation Byzantine robustness privacy

来源：评论

学校读者我要写书评

暂无评论

Leveraging ARM TrustZone and verifiable computing to Provide Auditable Mobile Functions 18

Leveraging ARM TrustZone and Verifiable Computing to Provide...

引用

15th EAI International Conference on Mobile and Ubiquitous Systems - computing, Networking and Services (Mobiquitous)

作者： Duarte, Nuno O. Yalew, Sileshi Demesie Santos, Nuno Correia, Miguel Univ Lisbon INESC ID IST Lisbon Portugal KTH Royal Inst Technol Stockholm Sweden

ISBN: (纸本)9781450360937

The increase of personal data on mobile devices has been followed by legislation that forces service providers to process and maintain users' data under strict data protection policies. In this paper, we propose a new primitive for mobile applications called auditable mobile function (AMF) to help service providers enforcing such policies by enabling them to process sensitive data within users' devices and collecting proofs of function execution integrity. We present SafeChecker, a computation verification system that provides mobile application support for AMFs, and evaluate the practicality of different usage scenario AMFs on TrustZone-enabled hardware.

关键词： verifiable computing Trusted computing Data protection regulations Auditable mobile functions

来源：评论

学校读者我要写书评

暂无评论

Betrayal, Distrust, and Rationality: Smart Counter-Collusion Contracts for verifiable Cloud computing 17

Betrayal, Distrust, and Rationality: Smart Counter-Collusion...

引用

24th ACM-SIGSAC Conference on Computer and Communications Security (ACM CCS)

作者： Dong, Changyu Wang, Yilei Aldweesh, Amjad McCorry, Patrick van Moorsel, Aad Newcastle Univ Newcastle Upon Tyne Tyne & Wear England UCL London England

ISBN: (纸本)9781450349468

Cloud computing has become an irreversible trend. Together comes the pressing need for verifiability, to assure the client the correctness of computation outsourced to the cloud. Existing verifiable computation techniques all have a high overhead, thus if being deployed in the clouds, would render cloud computing more expensive than the on-premises counterpart. To achieve verifiability at a reasonable cost, we leverage game theory and propose a smart contract based solution. In a nutshell, a client lets two clouds compute the same task, and uses smart contracts to stimulate tension, betrayal and distrust between the clouds, so that rational clouds will not collude and cheat. In the absence of collusion, verification of correctness can be done easily by crosschecking the results from the two clouds. We provide a formal analysis of the games induced by the contracts, and prove that the contracts will be effective under certain reasonable assumptions. By resorting to game theory and smart contracts, we are able to avoid heavy cryptographic protocols. The client only needs to pay two clouds to compute in the clear, and a small transaction fee to use the smart contracts. We also conducted a feasibility study that involves implementing the contracts in Solidity and running them on the official Ethereum network.

关键词： verifiable computing Smart Contract Game Theory Collusion Trust

来源：评论

学校读者我要写书评

暂无评论

Verifiability for privacy-preserving computing on distributed data - a survey

引用

INTERNATIONAL JOURNAL OF INFORMATION SECURITY 2025年第3期24卷 1-39页

作者： Bontekoe, Tariq Karastoyanova, Dimka Turkmen, Fatih Univ Groningen Groningen Netherlands

Privacy-preserving computation (PPC) solutions, such as secure multiparty computation (MPC) and homomorphic encryption (HE), are deployed increasingly often to guarantee data confidentiality for computations over private, distributed data. Similarly, we observe a steep increase in the adoption of zeroknowledge proofs (ZKPs) to guarantee (public) verifiability of locally executed computations. We project that applications that are data intensive and require strong privacy guarantees, are also likely to require verifiable correctness guarantees, especially when they are outsourced. Combining methods for verifiability and privacy protection has clear benefits, however certain challenges stand before their widespread practical adoption. In this work, we analyze existing solutions that combine verifiability with privacy-preserving computations over distributed data, in order to preserve confidentiality and guarantee correctness at the same time. We classify and compare 41 different schemes, regarding solution approach, security, efficiency, and practicality. Lastly, we discuss some of the most promising solutions in this regard, and present various open challenges and directions for future research.

关键词： Distributed ledger technologies Homomorphic encryption Public auditability Public verifiability Secure multiparty computation verifiable computing Zero-knowledge proofs

来源：评论

学校读者我要写书评

暂无评论

VeriEdge: Verifying and Enforcing Service Level Agreements for Pervasive Edge computing

VeriEdge: Verifying and Enforcing Service Level Agreements f...

引用

IEEE Conference on Computer Communications (IEEE INFOCOM)

作者： Wang, Xiaojian Yu, Ruozhou Yang, Dejun Gu, Huayue Li, Zhouyu NC State Univ Raleigh NC 27606 USA Colorado Sch Mines Golden CO 80401 USA

ISBN: (纸本)9798350383515;9798350383508

Edge computing gained popularity for its promises of low latency and high-quality computing services to users. However, it has also introduced the challenge of mutual untrust between user and edge devices for service level agreement (SLA) compliance. This obstacle hampers wide adoption of edge computing, especially in pervasive edge computing (PEC) where edge devices can freely enter or exit the market, which makes verifying and enforcing SLAs significantly more challenging. In this paper, we propose a framework for verifying and enforcing SLAs in PEC, allowing a user to assess SLA compliance of an edge service and ensure correctness of the service results. Our solution, called VeriEdge, employs a verifiable delayed sampling approach to sample a small number of computation steps, and relies on randomly selected verifiers to verify correctness of the computation results. To make sure the verification process is non-manipulable, we employ verifiable random functions to post-select the verifier(s). A dispute protocol is designed to resolve disputes for potential misbehavior. Rigorous security analysis demonstrates that VeriEdge achieves a high probability of detecting SLA violation with a minimal overhead. Experimental results indicate that VeriEdge is lightweight, practical, and efficient.

关键词： Edge computing service-level agreement verifiable computing service verification lightweight

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：