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

Watermarking Cryptographic Functionalities from Standard Lattice Assumptions

JOURNAL OF CRYPTOLOGY 2021年第3期34卷 28-28页

作者： Kim, Sam Wu, David J. Stanford Univ Stanford CA 94305 USA Univ Virginia Charlottesville VA USA

A software watermarking scheme allows one to embed a "mark" into a program without significantly altering the behavior of the program. Moreover, it should be difficult to remove the watermark without destroying the functionality of the program. Recently, Cohen et al. (STOC 2016) and Boneh et al. (PKC 2017) showed how to watermark cryptographic functions such as pseudorandom functions (PRFs) using indistinguishability obfuscation. Notably, in their constructions, the watermark remains intact even against arbitrary removal strategies. A natural question is whether we can build watermarking schemes from standard assumptions that achieve this strong mark-unremovability property. We give the first construction of a watermarkable family of PRFs that satisfies this strong mark-unremovability property from standard lattice assumptions (namely, the learning with errors (LWE) and the one-dimensional short integer solution (SIS) problems). As part of our construction, we introduce a new cryptographic primitive called a translucent PRF. We then give a concrete construction of a translucent PRF family from standard lattice assumptions, which in turn yields a watermarkable family of PRFs from the same assumptions.

关键词： coding and information theory Computational Mathematics and Numerical Analysis Combinatorics Probability theory and Stochastic Processes Communications Engineering Networks

来源：评论

学校读者我要写书评

暂无评论

Is There an Oblivious RAM Lower Bound for Online Reads?

引用

JOURNAL OF CRYPTOLOGY 2021年第3期34卷 18-18页

作者： Weiss, Mor Wichs, Daniel Bar Ilan Univ Fac Engn Ramat Gan Israel Northeastern Univ Dept Comp Sci Boston MA 02115 USA

Oblivious RAM (ORAM), introduced by Goldreich (STOC 1987) and Ostrovsky (STOC 1990), can be used to read and write to memory in a way that hides which locations are being accessed. The best known ORAM schemes have an O(logn) overhead per access, where n is the data size. The work of Goldreich and Ostrovsky (JACM 1996) gave a lower bound, showing that this is optimal for ORAM schemes that operate in a "balls and bins" model, where memory blocks can only be shuffled between different locations but not manipulated otherwise (and the server is used solely as remote storage). The lower bound even extends to weaker settings such as offline ORAM, where all of the accesses to be performed need to be specified ahead of time, and read-only ORAM, which only allows reads but not writes. But can we get lower bounds for general ORAM, beyond "balls and bins"? The work of Boyle and Naor (ITCS 2016) shows that this is unlikely in the offline setting. In particular, they construct an offline ORAM with o(logn) overhead assuming the existence of small sorting circuits. Although we do not have instantiations of the latter, ruling them out would require proving new circuit lower bounds. On the other hand, the recent work of Larsen and Nielsen (CRYPTO 2018) shows that there indeed is an omega(logn) lower bound for general online ORAM. This still leaves the question open for online read-only ORAM or for read/write ORAM where we want very small overhead for the read operations. In this work, we show that a lower bound in these settings is also unlikely. In particular, our main result is a construction of online ORAM, in which the server is used solely as remote storage, where reads (but not writes) have an o(logn)overhead, assuming the existence of small sorting circuits as well as very good locally decodable codes (LDCs). Although we do not have instantiations of either of these with the required parameters, ruling them out is beyond current lower bounds.

关键词： coding and information theory Computational Mathematics and Numerical Analysis Combinatorics Probability theory and Stochastic Processes Communications Engineering Networks

来源：评论

学校读者我要写书评

暂无评论

Limits on the Efficiency of (Ring) LWE-Based Non-interactive Key Exchange

引用

JOURNAL OF CRYPTOLOGY 2022年第1期35卷 1-1页

作者： Guo, Siyao Kamath, Pritish Rosen, Alon Sotiraki, Katerina NYU Shanghai Peoples R China TTIC Chicago IL USA IDC Herzliyya Israel UC Berkeley CA USA

LWE-based key-exchange protocols lie at the heart of post-quantum public-key cryptography. However, all existing protocols either lack the non-interactive nature of Diffie-Hellman key exchange or polynomial LWE-modulus, resulting in unwanted efficiency overhead. We study the possibility of designing non-interactive LWE-based protocols with polynomial LWE-modulus. To this end, we identify and formalize simple non-interactive and polynomial LWE-modulus variants of the existing protocols, where Alice and Bob simultaneously exchange one or more (ring) LWE samples with polynomial LWE-modulus and then run individual key reconciliation functions to obtain the shared key. We point out central barriers and show that such non-interactive key-exchange protocols are impossible in either of the following cases: (1) the reconciliation functions first compute the inner product of the received LWE sample with their private LWE secret. This impossibility is information theoretic. (2) One of the reconciliation functions does not depend on the error of the transmitted LWE sample. This impossibility assumes hardness of LWE. We show that progress toward either a polynomial LWE-modulus NIKE construction or a general impossibility result has implications to the current understanding of lattice-based cryptographic constructions. Overall, our results show possibilities and challenges in designing simple (ring) LWE-based non-interactive key-exchange protocols.

关键词： coding and information theory Computational Mathematics and Numerical Analysis Combinatorics Probability theory and Stochastic Processes Communications Engineering Networks

来源：评论

学校读者我要写书评

暂无评论

Unconditionally Secure Computation Against Low-Complexity Leakage

引用

JOURNAL OF CRYPTOLOGY 2021年第4期34卷 38-38页

作者： Bogdanov, Andrej Ishai, Yuval Srinivasan, Akshayaram Chinese Univ Hong Kong Shatin Hong Kong Peoples R China Technion Haifa Israel Tata Inst Fundamental Res Mumbai Maharashtra India

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).

关键词： coding and information theory Computational Mathematics and Numerical Analysis Combinatorics Probability theory and Stochastic Processes Communications Engineering Networks

来源：评论

学校读者我要写书评

暂无评论

Introduction to the Special Issue on TLS 1.3

引用

JOURNAL OF CRYPTOLOGY 2021年第3期34卷 24-24页

作者： Boyd, Colin NTNU Trondheim Norway

来源：评论

学校读者我要写书评

暂无评论

An efficient queries processing model based on Multi Broadcast Searchable Keywords Encryption (MBSKE)

引用

AD HOC NETWORKS 2020年第0期98卷 102028-000页

作者： Al-Maytami, Belal Ali Fan, Pingzhi Hussain, Abir Jaafar Baker, Thar Liatsis, Panos Southwest Jiaotong Univ Inst Mobile Commun Chengdu Peoples R China Liverpool John Moores Univ Dept Comp Sci Liverpool L3 3AF Merseyside England Khalifa Univ Sci & Technol Dept Elect Engn & Comp Sci Abu Dhabi U Arab Emirates

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.

关键词： Data encryption Cryptography coding and information theory

来源：评论

学校读者我要写书评

暂无评论

Secure Networked Inference with Unreliable Data Sources 1st ed. 2018

引用

2018年

作者： Aditya Vempaty Bhavya Kailkhura Pramod K. Varshney

ISBN: (数字)9789811323126

ISBN: (纸本)9789811323119

The book presents theory and algorithms for secure networked inference in the presence of Byzantines. It derives fundamental limits of networked inference in the presence of Byzantine data and designs robust strategies to ensure reliable performance for several practical network architectures. In particular, it addresses inference (or learning) processes such as detection, estimation or classification, and parallel, hierarchical, and fully decentralized (peer-to-peer) system architectures. Furthermore, it discusses a number of new directions and heuristics to tackle the problem of design complexity in these practical network architectures for inference.

关键词： Computer Communication Networks Data and information Security Communications Engineering, Networks Signal, Speech and Image Processing coding and information theory Probability and Statistics in Computer Science

来源：评论

学校读者我要写书评

暂无评论

information theory for Electrical Engineers 1st ed. 2018

引用

丛书名： Signals and Communication Technology

2018年

作者： Orhan Gazi

ISBN: (数字)9789811084324

ISBN: (纸本)9789811084317

This book explains the fundamental concepts of information theory, so as to help students better understand modern communication technologies. It was especially written for electrical and communication engineers working on communication subjects. The book especially focuses on the understandability of the topics, and accordingly uses simple and detailed mathematics, together with a wealth of solved examples. The book consists of four chapters, the first of which explains the entropy and mutual information concept for discrete random variables. Chapter 2 introduces the concepts of entropy and mutual information for continuous random variables, along with the channel capacity. In turn, Chapter 3 is devoted to the typical sequences and data compression. One of Shannons most important discoveries is the channel coding theorem, and it is critical for electrical and communication engineers to fully comprehend the theorem. As such, Chapter 4 solely focuses on it. To gain the most from the book, readers should have a fundamental grasp of probability and random variables; otherwise, they will find it nearly impossible to understand the topics discussed.

关键词： Communications Engineering, Networks coding and information theory

来源：评论

学校读者我要写书评

暂无评论

Compressed text indexes: From theory to practice

引用

ACM Journal of Experimental Algorithmics 2008年第PP1.12–1.31期13卷 1.12–1.31页

作者： Ferragina, Paolo González, Rodrigo Navarro, Gonzalo Venturini, Rossano University of Pisa Italy University of Chile Chile

A compressed full-text self-index represents a text in a compressed form and still answers queries efficiently. This represents a significant advancement over the (full-)text indexing techniques of the previous decade, whose indexes required several times the size of the text. Although it is relatively new, this algorithmic technology has matured up to a point where theoretical research is giving way to practical developments. Nonetheless this requires significant programming skills, a deep engineering effort, and a strong algorithmic background to dig into the research results. To date only isolated implementations and focused comparisons of compressed indexes have been reported, and they missed a common API, which prevented their re-use or deployment within other applications. The goal of this article is to fill this gap. First, we present the existing implementations of compressed indexes from a practitioner's point of view. Second, we introduce the Pizza & Chili site, which offers tuned implementations and a standardized API for the most successful compressed full-text self-indexes, together with effective test-beds and scripts for their automatic validation and test. Third, we show the results of our extensive experiments on these codes with the aim of demonstrating the practical relevance of this novel algorithmic technology. Categories and Subject Descriptors: F.2.2 [Analysis of Algorithms and Problem Complexity]: Nonnumerical Algorithms and Problems-Pattern matching, computations on discrete structures, sorting and searching;H.2.1 [Database Management]: Physical Design-Access methods;H.3.2 [information Storage and Retrieval]: information Storage-File organization;H.3.3 [information Storage and Retrieval]: information Search and Retrieval-Search process General Terms: Algorithms Additional Key Words and Phrases: Text indexing, text compression, data structures, data storage representation, coding and information theory, indexing methods, textual databases, bi

关键词： Text indexing bioinformatics databases coding and information theory data storage representation data structures indexing methods text compression textual databases

来源：评论

学校读者我要写书评

暂无评论

Implementing the LZ-index: theory versus Practice

引用

ACM Journal of Experimental Algorithmics 2009年第PP1.2–1.49期13卷 1.2-1.49页

作者： Navarro, Gonzalo Department of Computer Science University of Chile Santiago Blanco Encalada 2120 Chile

The LZ-index is a theoretical proposal of a lightweight data structure for text indexing, based on the Ziv-Lempel trie. If a text of u characters over an alphabet of size σ is compressible to n symbols using the LZ78 algorithm, then the LZ-index takes 4n log₂ n(1 + o(1)) bits of space (that is, 4 times the entropy of the text) and reports the R occurrences of a pattern of length m in worst case time O(m³logσ + (m + R)logn). In this paper we face the challenge of obtaining a practical implementation of the LZ-index, which is not at all straightforward from the theoretical proposal. We end up with a prototype that takes the promised space and has average search time [formula omitted]. This prototype is shown to be faster than other competing approaches when we take into account the time to report the positions or text contexts of the occurrences found. We show in detail the process of implementing the index, which involves interesting lessons of theory versus practice. Categories and Subject Descriptors: F.2.2 [Analysis of Algorithms and Problem Complexity]: Nonnumerical algorithms and problems—Pattern matching, computations on discrete structures, sorting and searching;H.2.1 [Database Management]: Physical design—Access methods;H.3.2 [information Storage and Retrieval]: information storage—File organization;H.3.3 [information Storage and Retrieval]: information search and retrieval—Search process. © 2009, ACM. All rights reserved.

关键词： Algorithms coding and information theory data storage representations Data structures indexing methods textual databases

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：