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

37th ACM SIGACT-SIGOPS Symposium on Principles of distributed computing (PODC)

作者： Bhadauria, Rishabh Choudhury, Ashish Int Inst Informat Technol Bangalore Bengaluru India

ISBN: (纸本)9781450357951

In this paper, we consider two fundamental problems in secure distributed computing, namely Asynchronous Byzantine Agreement (ABA) and Asynchronous secure Multi party Computation (ASMPC). Our focus is on the honest majority setting, involving a set of n mutually distrusting parties, t of which can be under the control of a computationally bounded Byzantine adversary Adv, where t < n/2. It is well known that in the cryptographic setting where the parties have access to a public-key infrastructure (PKI) set-up and are connected by pair-wise channels, both ABA and ASMPC requires t < n/3. However, Clement et al. (PODC 2012) and Backes et al. (PODC 2014) showed that it is possible to design computationally-secure ABA and ASMPC protocols respectively, even with t < n/2, provided the parties are available with a transferrable non-equivocation mechanism. Non-equivocation is a message authentication mechanism, which prevents a corrupt sender from sending conflicting messages to different parties. The transferability of the mechanism enables a receiver to verifiably transfer any authenticated statement to other parties, on behalf of the sender. In this paper, we revisit the work of Clement et al. and Backes et al. and show the following: If n <= 3t, then it is impossible to achieve the traditional notion of validity by any ABA protocol, which demands that if the inputs of all honest parties are same, say x, then all honest parties should output x at the end of the protocol. Moreover, this holds even if the parties are equipped with a transferrable non-equivocation mechanism. The input phase of the ASMPC protocol of Backes et al (and hence the overall ASMPC protocol) may never terminate for the honest parties. The input phase runs an asynchronous primitive called Agreement on a Common Subset (ACS), which allows the honest parties to agree upon a common subset of n - t parties who provide their inputs for the computation. The ACS primitive runs n parallel instances of an ABA pr

关键词： non-equivocation fault-tolerance secure distributed computing

来源：评论

学校读者我要写书评

暂无评论

Trustworthy distributed Computations on Personal Data Using Trusted Execution Environments 18

Trustworthy Distributed Computations on Personal Data Using ...

引用

18th IEEE International Conference on Trust, Security and Privacy in computing and Communications (IEEE TrustCom) / 13th IEEE International Conference on Big Data Science and Engineering (IEEE BigDataSE)

作者： Ladjel, Riad Anciaux, Nicolas Pucheral, Philippe Scerri, Guillaume INRIA UVSQ Versailles France

ISBN: (纸本)9781728127767

Thanks to new regulations like GDPR, Personal Data Management Systems (PDMS) have become a reality. This decentralized way of managing personal data provides a de facto protection against massive attacks on central servers. But, when performing distributed computations, this raises the question of how to preserve individuals' trust on their PDMS? And how to guarantee the integrity of the final result? This paper proposes a secure computing framework capitalizing on the use of Trusted Execution Environments at the edge of the network to tackle these questions.

关键词： Data privacy TEE secure distributed computing

来源：评论

学校读者我要写书评

暂无评论

Order-preserving encryption using approximate common divisors

引用

JOURNAL OF INFORMATION SECURITY AND APPLICATIONS 2019年 49卷

作者： Dyer, James Dyer, Martin Djemame, Karim Univ Huddersfield Dept Comp Sci Huddersfield HD1 3DH W Yorkshire England Univ Leeds Sch Comp Leeds LS2 9JT W Yorkshire England

Order-preservation is a highly desirable property for encrypted databases as it allows range queries over ciphertexts. Order-preserving encryption (OPE) is used in the encrypted database systems CryptDB and Cipherbase. The former has been adopted by several commercial organisations and the latter was developed as an extension of Microsoftas SQLServer. We present two novel, but simple, randomised OPE schemes based on the general approximate common divisor problem (GACDP) and decisional polynomial approximate common divisor problem (DPolyACDP) respectively. These appear to be the first OPE schemes to be based on a computational hardness primitive, rather than a security game. Our GACDP based scheme is very efficient, requiring only O(1) arithmetic operations for encryption and decryption. Our DPolyACDP based scheme is similarly efficient. We show that these schemes have near optimal information leakage. We demonstrate how our OPE schemes can be integrated into a secure distributed computing system which computes over encrypted data. We report on an extensive evaluation of our GACDP-based algorithms in such a scenario, a MapReduce computation over encrypted data. The results clearly demonstrate extremely favourable execution times in comparison with existing OPE schemes. (C) 2019 Elsevier Ltd. All rights reserved.

关键词： Order-preserving encryption secure distributed computing Symmetric cipher Approximate common divisors

来源：评论

学校读者我要写书评

暂无评论

Multi-valued Asynchronous Reliable Broadcast with a Strict Honest Majority 17

Multi-valued Asynchronous Reliable Broadcast with a Strict H...

引用

18th International Conference on distributed computing and Networking (ICDCN)

作者： Choudhury, Ashish Int Inst Informat Technol 26-C Elect CityHosur Rd Bangalore 560100 Karnataka India

ISBN: (纸本)9781450348393

Asynchronous reliable broadcast is a fundamental primitive in secure distributed computing. In an asynchronous system of n mutually distrusting parties with t of them being Byzantine corrupted, reliable broadcast is possible if and only if t < n / 3. With t < n / 3 there exists multi-valued asynchronous reliable broadcast protocol with optimal communication complexity of O (nl) bits for broadcasting l-bit messages, provided l is sufficiently large. In this work, we give a multi-valued asynchronous reliable broadcast protocol with t < n / 2 and with communication complexity O (nl) bits for sufficiently large l. To beat the lower bound of t < n / 3, we deploy a non-equivocation mechanism, which can be instantiated using cryptography, along with a trusted hardware set-up. Such a mechanism prevents a corrupted party from sending conflicting messages to different (honest) parties. The applicability of non-equivocation mechanism has been investigated in the past to improve the fault-tolerance of secure distributed protocols in the asynchronous setting. This is the first work for deploying the non-equivocation mechanism to improve the communication complexity of asynchronous protocols.

关键词： Fault tolerance secure distributed computing

来源：评论

学校读者我要写书评

暂无评论

GATEway: symbiotic inter-domain traffic engineering

引用

TELECOMMUNICATION SYSTEMS 2011年第1-2期47卷 3-17页

作者： Roughan, Matthew Zhang, Yin Univ Adelaide Adelaide SA Australia Univ Texas Austin Austin TX 78712 USA

There are a group of problems in networking that can most naturally be described as optimization problems (network design, traffic engineering, etc.). There has been a great deal of research devoted to solving these problems, but this research has been concentrated on intra-domain problems where one network operator has complete information and control. An emerging field is inter-domain engineering, for instance, traffic engineering between large autonomous networks. Extending intra-domain optimization techniques to inter-domain problems is often impossible without the information available within a domain, and providers are often unwilling to share such information. This paper presents an alternative: we propose a method for traffic engineering that does not require sharing of important information across domains. The method extends the idea of genetic algorithms to allow symbiotic evolution between two parties. Both parties may improve their performance without revealing their data, other than what would be easily observed in any case. We show the method provides large reductions in network congestion, close to the optimal shortest path routing across a pair of networks. The results are highly robust to measurement noise, the method is very flexible, and it can be applied using existing routing.

关键词： Traffic engineering Genetic algorithms Evolutionary computing Symbiosis Privacy secure distributed computing

来源：评论

学校读者我要写书评

暂无评论

GATEway: symbiotic inter-domain traffic engineering

GATEway: symbiotic inter-domain traffic engineering

引用

International Conference on Game Theory for Networks

作者： Roughan, Matthew Zhang, Yin Univ Adelaide Adelaide SA Australia Univ Texas Austin Austin TX 78712 USA

关键词： Traffic engineering Genetic algorithms Evolutionary computing Symbiosis Privacy secure distributed computing

来源：评论

学校读者我要写书评

暂无评论

On the confidential auditing of distributed computing systems

On the confidential auditing of distributed computing system...

引用

24th International Conference on distributed computing Systems

作者： Shen, YP Lam, TC Liu, JC Zhao, W Texas A&M Univ Dept Comp Sci College Stn TX 77843 USA

ISBN: (纸本)0769520863

In this paper, we propose a confidential logging and auditing service for distributed information systems. We propose a cluster-based TTP (trusted third party) architecture for the event log auditing services, so that no single TTP node can have the full knowledge of the logs, and thus no single node can misuse the log information without being detected. On the basis of a relaxed form of secure distributed computing paragidms, one can implement confidential auditing service so that the auditor can retrieve certain aggregated system information e.g., the number of transactions, the total volume, the event traces, etc., without having to access the full log data. Similar to the peer relationship of routers to provide global network routing services, the mutually supported, mutually monitored cluster TTP architecture allows independent systems to collaborate in network-wide auditing without compromising their private information.

关键词： auditing commutative cryptography secure distributed computing cluster anonymity authenticity

来源：评论

学校读者我要写书评

暂无评论

On the practical feasibility of secure distributed computing - A case study

On the practical feasibility of secure distributed computing...

引用

16th International-Federation-for-Information-Processing World Computer Congress (IFIP 2000)/Annual Conference of TC11 (SEC 2000)

作者： Neven, G Piessens, F De Decker, B Katholieke Univ Leuven Dept Comp Sci B-3001 Louvain Belgium

ISBN: (纸本)0792379144

secure distributed computing addresses the problem of performing a computation with a number of mutually distrustful participants, in such a way that each of the participants has only limited access to the information needed for doing the computation. Over the past decade, a number of solutions for this problem have been developed. The various number of solutions for this problem have been developed. The various proposed solutions differ in the cryptographic primitives that are used, and in the class of computations that can be performed. However, all sufficiently general solutions have one thing in common: the communication overhead between the involved parties seems to be prohibitive. In this paper, we consider a concrete instance (with considerable practical interest) of the general problem of secure distributed computing, and we investigate how bad the communication overhead really is. This involves tailoring the different general solutions to the specific problem at hand, optimizing them for minimal communication overhead, and evaluating the resulting communication overhead.

关键词： secure distributed computing cryptography communication overhead

来源：评论

学校读者我要写书评

暂无评论

secure vickrey auctions without a trusted third party - A prototype

引用

18th International Conference on Information Security

作者： De Decker, B Neven, G Piessens, F Katholieke Univ Leuven Dept Comp Sci B-3001 Heverlee Belgium

ISBN: (纸本)1402074492

secure distributed computing addresses the problem of performing a computation with a number of mutually distrustful participants, ill such a way that each of the participants has only limited access to the information needed for doing the computation. Over the past two decades, a number of solutions requiring no trusted third party have been developed using cryptographic techniques. The disadvantage of these cryptographic solutions is the excessive communication overhead they incur. In this paper, we examine a case study: a Vickrey auction without a trusted third party. The design is explained and the communication overhead studied. Several techniques to reduce or alleviate this overhead are discussed.

关键词： secure vickrey auction secure distributed computing SDC agents multiparty computation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：