[图书][B] Extremal combinatorics: with applications in computer science

S Jukna - 2011 - Springer
This book is a concise, self-contained, up-to-date introduction to extremal combinatorics for
nonspecialists. There is a strong emphasis on theorems with particularly elegant and …

Proofs, arguments, and zero-knowledge

J Thaler - Foundations and Trends® in Privacy and Security, 2022 - nowpublishers.com
Interactive proofs (IPs) and arguments are cryptographic protocols that enable an untrusted
prover to provide a guarantee that it performed a requested computation correctly …

Diagonal circuit identity testing and lower bounds

N Saxena - … : 35th International Colloquium, ICALP 2008, Reykjavik …, 2008 - Springer
In this paper we give the first deterministic polynomial time algorithm for testing whether a
diagonal depth-3 circuit C (x 1,..., xn)(ie C is a sum of powers of linear functions) is zero. We …

[图书][B] Polynomial methods and incidence theory

A Sheffer - 2022 - books.google.com
The past decade has seen numerous major mathematical breakthroughs for topics such as
the finite field Kakeya conjecture, the cap set conjecture, Erdős's distinct distances problem …

Practical homomorphic encryption over the integers for secure computation in the cloud

J Dyer, M Dyer, J Xu - International Journal of Information Security, 2019 - Springer
We present novel homomorphic encryption schemes for integer arithmetic, intended
primarily for use in secure single-party computation in the cloud. These schemes are …

Testers and their applications

N Bshouty - Proceedings of the 5th conference on Innovations in …, 2014 - dl.acm.org
We develop a new notion called tester of a class M of functions f: A→ C that maps the
elements α∈ A in the domain A of the function to a finite number (the size of the tester) of …

Polynomial Identity Testing and the Ideal Proof System: PIT is in NP if and only if IPS can be p-simulated by a Cook-Reckhow proof system

JA Grochow - arXiv preprint arXiv:2306.02184, 2023 - arxiv.org
The Ideal Proof System (IPS) of Grochow & Pitassi (FOCS 2014, J. ACM, 2018) is an
algebraic proof system that uses algebraic circuits to refute the solvability of unsatisfiable …

[图书][B] Design and analysis of cryptographic algorithms in blockchain

K Huang, Y Mu, F Rezaeibagha, X Zhang - 2021 - taylorfrancis.com
This book seeks to generalize techniques and experiences in designing and analyzing
cryptographic schemes for blockchain. It devotes three chapters to review the background …

Practical homomorphic encryption over the integers

J Dyer, M Dyer, J Xu - arXiv preprint arXiv:1702.07588, 2017 - arxiv.org
We present novel homomorphic encryption schemes for integer arithmetic, intended for use
in secure single-party computation in the cloud. These schemes are capable of securely …

[PDF][PDF] 基于再生码的拟态数据存储方案

陈越, 王龙江, 严新成, 张馨月 - Journal on Communication …, 2018 - infocomm-journal.com
针对云存储系统由于静态的存储架构和存储模式而带来的安全威胁, 提出一种基于再生码的拟态
化存储方案. 该方案利用网络编码方案将数据存储在云端数据节点上, 采用一种基于再生码的 …