搜索结果: 1-15 共查到“locality”相关记录65条 . 查询时间(0.062 秒)
The foundation of zero-knowledge is the simulator: a weak machine capable of pretending to be a weak verifier talking with all-powerful provers. To achieve this, simulators need some kind of advantage...
Oblivious RAM protocols (ORAMs) allow a client to access data from an untrusted storage device without revealing to that device any information about their access pattern. Typically this is accomplish...
In multi-prover interactive proofs, the verifier interrogates the provers and attempts to steal their knowledge. Other than that, the verifier's role has not been studied. Augmentation of the provers ...
Oblivious RAM compilers, introduced by Goldreich and Ostrovsky [JACM'96], compile any RAM program into one that is "memory-oblivious'' (i.e., the access pattern to the memory is independent of the inp...
Searchable Encryption with Optimal Locality: Achieving Sublogarithmic Read Efficiency
Searchable Encryption Locality Read Efficiency
2017/8/9
We propose the first linear-space searchable encryption scheme with constant locality and sublogarithmic read efficiency, strictly improving the previously best known read efficiency bound (Asharov et...
Influence of site conditions and silvicultural practice on the wood density of Scots pine (Pinus sylvestris L.) – a case study from the Doksy locality, Czech Republic
shelterwood regeneration clearcut forest site softwoods physical properties variability
2018/3/6
After spruce, the Scots pine (Pinus sylvestris Linnaeus) is the second most important commercial coniferous tree
species in the Czech Republic. However, we are finding out that awareness of the varia...
IO-DSSE: Scaling Dynamic Searchable Encryption to Millions of Indexes By Improving Locality
secret-key cryptography searchable encryption
2016/12/10
Free cloud-based services are powerful candidates for deploying ubiquitous encryption for messaging. In the case of email and increasingly chat, users expect the ability to store and search their mess...
Indistinguishability Obfuscation from DDH on 5-linear Maps and Locality-5 PRGs
Indistinguishability Obfuscation 5-linear Maps Local PRG
2016/12/7
When plugging in a candidate PRG with locality-5 (eg, [Goldreich, ECCC 2010, O'Donnell and Witmer, CCC 2014]), we obtain a construction of IO from subexponential DDH on 5-linear maps and LWE. Previous...
A Stronger Bell Argument for Quantum Non-Locality
philosophy of physics quantum theory Bell's theorem EPR argument non-locality probabilistic analysis
2016/6/15
It is widely accepted that the violation of Bell inequalities excludes local theories of the quantum realm. This paper presents a stronger Bell argu- ment which even forbids certain non-local theories...
Diagrams as Locality Aids for Explanation and Model Construction in Cell Biology
cell biology diagram explanation locality aid model construction
2016/5/30
Using as case studies two early diagrams that represent mechanisms of the cell division cycle, we aim to extend prior philosophical analyses of the roles of diagrams in scientific reasoning, and speci...
Legion: Expressing Locality and Independence with Logical Regions
Legion Expressing Locality Independence Logical Regions
2016/5/24
Modern parallel architectures have both heterogeneous processors and deep, complex memory hierarchies. We present Legion, a programming model and runtime system for achieving high performance on these...
Searchable Symmetric Encryption: Optimal Locality in Linear Space via Two-Dimensional Balanced Allocations
SSE classic balanced allocations
2016/3/8
Searchable symmetric encryption (SSE) enables a client to store a database on an untrusted
server while supporting keyword search in a secure manner. Despite the rapidly increasing interest
in SSE t...
Unified Oblivious-RAM: Improving Recursive ORAM with Locality and Pseudorandomness
Oblivious Ram access pattern locality
2016/1/25
Oblivious RAM (ORAM) is a cryptographic primitive that hides memory access patterns to untrusted storage. ORAM may be used in secure processors for encrypted computation and/or software protection. Wh...
The Locality of Searchable Symmetric Encryption
secret-key cryptography Symmetric Encryption
2016/1/23
This paper proves a lower bound on the trade-off between server storage size and the locality of memory accesses in searchable symmetric encryption (SSE). Namely, when encrypting an index of N ident...
Optimally Resilient and Adaptively Secure Multi-Party Computation with Low Communication Locality
secure multi-party computation communication locality adaptive security
2016/1/8
Secure multi-party computation (MPC) has been thoroughly studied over the past decades.
The vast majority of works assume a full communication pattern: every party exchanges messages
with all the ne...