搜索结果: 1-15 共查到“军事学 Parallel”相关记录77条 . 查询时间(0.156 秒)
A Tight Parallel-Repetition Theorem for Random-Terminating Interactive Arguments
parallel repetition interactive argument smooth KL-divergence
2019/4/22
Soundness amplification is a central problem in the study of interactive protocols. While ``natural'' parallel repetition transformation is known to reduce the soundness error of some special cases of...
Semi-parallel Logistic Regression for GWAS on Encrypted Data
Homomorphic encryption Genome-wide association studies Logistic regression
2019/3/21
The sharing of biomedical data is crucial to enable scientific discoveries across institutions and improve health care. For example, genome-wide association studies (GWAS) based on a large number of s...
Privacy-preserving semi-parallel logistic regression training with Fully Homomorphic Encryption
fully homomorphic encryption logistic regression genome privacy
2019/2/27
Background Privacy-preserving computations on genomic data, and more generally on medical data, is a critical path technology for innovative, life-saving research to positively and equally impact the ...
FPGA-based High-Performance Parallel Architecture for Homomorphic Computing on Encrypted Data
FV homomorphic encryption latticebased cryptography polynomial multiplication
2019/2/25
Homomorphic encryption is a tool that enables computation on encrypted data and thus has applications in privacy-preserving cloud computing. Though conceptually amazing, implementation of homomorphic ...
Parallel Chains: Improving Throughput and Latency of Blockchain Protocols via Parallel Composition
Bitcoin blockchain parallel composition
2018/11/21
Two of the most significant challenges in the design of blockchain protocols is increasing their transaction processing throughput and minimising latency in terms of transaction settlement. In this wo...
Improved Parallel Mask Refreshing Algorithms: Generic Solutions with Parametrized Non-Interference \& Automated Optimizations
Side-channel attacks masking countermeasure refreshing algorithms
2018/5/28
Refreshing algorithms are a critical ingredient for secure masking. They are instrumental in enabling sound composability properties for complex circuits, and their randomness requirements dominate th...
We show that PRAMs can be obliviously simulated with perfect security, incurring only O(logNloglogN) blowup in parallel runtime, O(log3N) blowup in total work, and O(1) blowup in space relative to the...
Efficient Parallel Binary Operations on Homomorphic Encrypted Real Numbers
implementation homomorphic encryption
2018/3/5
A number of homomorphic encryption application areas, such as privacy-preserving machine learning analysis in the cloud, could be better enabled if there existed a general solution for combining suffi...
(A Counterexample to) Parallel Repetition for Non-Signaling Multi-Player Games
parallel repetition non-signaling strategies
2017/11/28
We give a three-player game whose non-signaling value is constant (2/3) under any number of parallel repetitions. This is the first known setting where parallel repetition completely fails to reduce t...
On the Depth of Oblivious Parallel RAM
OPRAM PRAM
2017/9/13
Oblivious Parallel RAM (OPRAM), first proposed by Boyle, Chung, and Pass, is the natural parallel extension of Oblivious RAM (ORAM). OPRAM provides a powerful cryptographic building block for hiding t...
Low-communication parallel quantum multi-target preimage search
quantum cryptanalysis multi-target preimages parallel rho method
2017/8/22
The most important pre-quantum threat to AES-128 is the 1994 van Oorschot--Wiener "parallel rho method", a low-communication parallel pre-quantum multi-target preimage-search algorithm. This algorithm...
Parallel versions of collision search algorithms require a significant amount of memory to store a proportion of the points computed by the pseudo-random walks. Implementations available in the litera...
Round-Preserving Parallel Composition of Probabilistic-Termination Cryptographic Protocols
secure multi-party computation parallel composition broadcast
2017/4/27
An important benchmark for multi-party computation protocols (MPC) is their round complexity. For several important MPC tasks, (tight) lower bounds on the round complexity are known. However, for some...
Farfalle: parallel permutation-based cryptography
pseudorandom function permutation-based crypto Keccak
2017/1/3
In this paper, we introduce Farfalle, a new mode for building a pseudorandom function (PRF) from a b-bit cryptographic permutation. The constructed PRF takes as input a b-bit key and a sequence of var...
An Oblivious Parallel RAM with $O(\log^2 N)$ Parallel Runtime Blowup
Oblivious RAM Oblivious Parallel RAM
2016/12/15
Oblivious RAM (ORAM) is a cryptographic primitive that allows a client to access memory locations from a server without revealing its access patterns. Oblivious Parallel RAM (OPRAM) is a PRAM counterp...
