We consider the problem of constructing leakage-resilient circuit compilers that are secure against global leakage functions with bounded output length. By global, we mean that the leakage can depend on all circuit wi...
详细信息
We consider the problem of constructing leakage-resilient circuit compilers that are secure against global leakage functions with bounded output length. By global, we mean that the leakage can depend on all circuit wires and output a low-complexity function (represented as a multi-output Boolean circuit) applied on these wires. In this work, we design compilers both in the stateless (a.k.a. single-shot leakage) setting and the stateful (a.k.a. continuous leakage) setting that are unconditionally secure against AC0 leakage and similar low-complexity classes. In the stateless case, we show that the original private circuits construction of Ishai, Sahai, and Wagner (Crypto 2003) is actually secure against AC0 leakage. In the stateful case, we modify the construction of Rothblum (Crypto 2012), obtaining a simple construction with unconditional security. Prior works that designed leakage-resilient circuit compilers against AC0 leakage had to rely either on secure hardware components (Faust et al., Eurocrypt 2010, Miles-Viola, STOC 2013) or on (unproven) complexity-theoretic assumptions (Rothblum, Crypto 2012).
This volume explores the rich interplay between number theory and wireless communications, reviewing the surprisingly deep connections between these fields and presenting new research directions to inspire future rese...
详细信息
ISBN:
(数字)9783030613037
ISBN:
(纸本)9783030613020
This volume explores the rich interplay between number theory and wireless communications, reviewing the surprisingly deep connections between these fields and presenting new research directions to inspire future research.
We prove that a known general approach to improve Shamir's celebrated secret sharing scheme;i.e., adding an information-theoretic authentication tag to the secret, can make it robust for n parties against any coll...
详细信息
We prove that a known general approach to improve Shamir's celebrated secret sharing scheme;i.e., adding an information-theoretic authentication tag to the secret, can make it robust for n parties against any collusion of size n, for any constant (0,1/2). Shamir's original scheme is robust for all (0,1/3). Beyond that, we employ the best known list decoding algorithms for Reed-Solomon codes and show that, with high probability, only the correct secret maintains the correct information-theoretic tag if an algebraic manipulation detection (AMD) code is used to tag secrets. This result holds in the so-called non-rushing model in which the n shares are submitted simultaneously for reconstruction. We thus obtain a fully explicit and robust secret sharing scheme in this model that is essentially optimal in all parameters including the share size which is k(1+o(1))+O(), where k is the secret length and is the security parameter. Like Shamir's scheme, in this modified scheme any set of more than n honest parties can efficiently recover the secret. Using algebraic geometry codes instead of Reed-Solomon codes, the share length can be decreased to a constant (only depending on ) while the number of shares n can grow independently. In this case, when n is large enough, the scheme satisfies the threshold requirement in an approximate sense;i.e., any set of n(1+) honest parties, for arbitrarily small >0, can efficiently reconstruct the secret. From a practical perspective, the main importance of our result is in showing that existing systems employing Shamir-type secret sharing schemes can be made much more robust than previously thought with minimal change, essentially only involving the addition of a short and simple checksum to the original data.
Cloud computing is a technology which has enabled many organizations to outsource their data in an encrypted form to improve processing times. The public Internet was not initially designed to handle massive quantitie...
详细信息
Cloud computing is a technology which has enabled many organizations to outsource their data in an encrypted form to improve processing times. The public Internet was not initially designed to handle massive quantities of data flowing through millions of networks. Thus, the rapid increase in broadcast users and growth in the amount of broadcasted information leads to a decrease in the speed of sending queries and receiving encrypted data from the cloud. In order to address this issue, Next Generation Internet (NGI) is being developed, capable of high speeds, while maintaining data privacy. This research proposes a novel search algorithm, entitled Multi-broadcast Searchable Keywords Encryption, which processes queries through a set of keywords. This set of keywords is sent from the users to the cloud server in an encrypted form, thus hiding all information about the user and the content of the queries from the cloud server. The proposed method uses a caching algorithm and provides an improvement of 40% in terms of runtime and trapdoor. In addition, the method minimizes computational costs, complexity, and maximizes throughput, in the cloud environment, whilst maintaining privacy and confidentiality of both the user and the cloud. The cloud returns encrypted query results to the user, where data is decrypted using the user's private keys. (C) 2019 Published by Elsevier B.V.
This book discusses the latest channel coding techniques, MIMO systems, and 5G channel coding evolution. It provides a comprehensive overview of channel coding, covering modern techniques such as turbo codes, low-dens...
详细信息
ISBN:
(数字)9789811505614
ISBN:
(纸本)9789811505607
This book discusses the latest channel coding techniques, MIMO systems, and 5G channel coding evolution. It provides a comprehensive overview of channel coding, covering modern techniques such as turbo codes, low-density parity-check (LDPC) codes, space—time coding, polar codes, LT codes, and Raptor codes as well as the traditional codes such as cyclic codes, BCH, RS codes, and convolutional codes. It also explores MIMO communications, which is an effective method for high-speed or high-reliability wireless communications. It also examines the evolution of 5G channel coding techniques. Each of the 13 chapters features numerous illustrative examples for easy understanding of the coding techniques, and MATLAB-based programs are integrated in the text to enhance readers' grasp of the underlying theories. Further, PC-based MATLAB m-files for illustrative examples are included for students and researchers involved in advanced and current concepts of codingtheory.
We show that expander codes, when properly instantiated, are high-rate list recoverable codes with linear-time list recovery algorithms. List recoverable codes have applications to constructing efficiently list-decoda...
详细信息
We show that expander codes, when properly instantiated, are high-rate list recoverable codes with linear-time list recovery algorithms. List recoverable codes have applications to constructing efficiently list-decodable codes, as well as in compressed sensing and group testing. Previous list recoverable codes with linear-time decoding algorithms have all had rate at most 1/2;in contrast, our codes can have rate 1-epsilon for any epsilon > 0. We can plug our high-rate codes into a construction of Alon and Luby (1996), recently highlighted by Meir (2014) to obtain linear-time list recoverable codes of arbitrary rates R, which approach the optimal trade-off between the number of non-trivial lists provided and the rate of the code. A slight strengthening of our result would imply linear-time and optimally list-decodable codes for all rates. Thus, our result is a step in the direction of solving this important problem. (C) 2018 Elsevier Inc. All rights reserved.
We show that expander codes, when properly instantiated, are high-rate list recoverable codes with linear-time list recovery algorithms. List recoverable codes have applications to constructing efficiently list-decoda...
详细信息
ISBN:
(纸本)9783662476710
We show that expander codes, when properly instantiated, are high-rate list recoverable codes with linear-time list recovery algorithms. List recoverable codes have applications to constructing efficiently list-decodable codes, as well as in compressed sensing and group testing. Previous list recoverable codes with linear-time decoding algorithms have all had rate at most 1/2;in contrast, our codes can have rate 1-epsilon for any epsilon > 0. We can plug our high-rate codes into a construction of Alon and Luby (1996), recently highlighted by Meir (2014) to obtain linear-time list recoverable codes of arbitrary rates R, which approach the optimal trade-off between the number of non-trivial lists provided and the rate of the code. A slight strengthening of our result would imply linear-time and optimally list-decodable codes for all rates. Thus, our result is a step in the direction of solving this important problem. (C) 2018 Elsevier Inc. All rights reserved.
暂无评论