搜索结果: 1-15 共查到“密码学 Lower Bounds”相关记录46条 . 查询时间(0.078 秒)
Security-Efficiency Tradeoffs in Searchable Encryption -- Lower Bounds and Optimal Constructions
searchable encryption lower bound
font style='font-size:12px;'>
2019/6/13
Besides their security, the efficiency of searchable encryption schemes is a major criteria when it comes to their adoption: in order to replace an unencrypted database by a more secure construction, ...
Lower Bounds for Oblivious Near-Neighbor Search
oblivious RAM lower bound near-neighbors
font style='font-size:12px;'>
2019/4/16
We prove an Ω(dlgn/(lglgn)2)Ω(dlgn/(lglgn)2) lower bound on the dynamic cell-probe complexity of statistically obliviousoblivious approximate-near-neighbor search (ANNANN) over th...
Exponential Lower Bounds for Secret Sharing
Secret Sharing Lower Bound
font style='font-size:12px;'>
2019/3/1
A secret sharing scheme allows a dealer to distribute shares of a secret among a set of nn parties P={p1,…,pn}P={p1,…,pn} such that any authorized subset of parties can reconstruct the secret, yet any...
Lower Bounds for Leakage-Resilient Secret Sharing
Lower Bound Secret Sharing Leakage-Resilience
font style='font-size:12px;'>
2019/3/1
Threshold secret sharing allows a dealer to split a secret into nn shares such that any authorized subset of cardinality at least tt of those shares efficiently reveals the secret, while at the same t...
Further Lower Bounds for Structure-Preserving Signatures in Asymmetric Bilinear Groups
public-key cryptography Structure-Preserving Signatures
font style='font-size:12px;'>
2019/1/2
Structure-Preserving Signatures (SPSs) are a useful tool for the design of modular cryptographic protocols. Recent series of works have shown that by limiting the message space of those schemes to the...
Lower Bounds for Differentially Private RAMs
oblivious RAM differential privacy lower bounds
font style='font-size:12px;'>
2018/11/2
In this work, we study privacy-preserving storage primitives that are suitable for use in data analysis on outsourced databases within the differential privacy framework. The goal in differentially pr...
Lower Bounds on Structure-Preserving Signatures for Bilateral Messages
Structure-Preserving Signatures Bilateral Messages Crucial Relation
font style='font-size:12px;'>
2018/7/9
Lower bounds for structure-preserving signature (SPS) schemes based on non-interactive assumptions have only been established in the case of unilateral messages, i.e. schemes signing tuples of group e...
Lower Bounds on Lattice Enumeration with Extreme Pruning
Lattices Enumeration Pruning Security Estimates
font style='font-size:12px;'>
2018/6/13
At Eurocrypt '10, Gama, Nguyen and Regev introduced lattice enumeration with extreme pruning: this algorithm is implemented in state-of-the-art lattice reduction software and used in challenge records...
Upper and Lower Bounds for Continuous Non-Malleable Codes
Continuous non-malleable codes black box impossibility split-state
font style='font-size:12px;'>
2018/5/30
Recently, Faust et al. (TCC'14) introduced the notion of continuous non-malleable codes (CNMC), which provides stronger security guarantees than standard non-malleable codes, by allowing an adversary ...
Memory Lower Bounds of Reductions Revisited
memory tightness lower-bound
font style='font-size:12px;'>
2018/3/7
In Crypto 2017, Auerbach et al. initiated the study on memory-tight reductions and proved two negative results on the memory-tightness of restricted black-box reductions from multi-challenge security ...
New Lower Bounds on Predicate Entropy for Function Private Public-Key Predicate Encryption
Predicate Encryption Public-Key Function Privacy
font style='font-size:12px;'>
2018/3/6
We present function private public-key predicate encryption schemes from standard cryptographic assumptions, that achieve new lower bounds on the min-entropy of underlying predicate distributions. Exi...
Bandwidth-Hard Functions: Reductions and Lower Bounds
Cryptanalysis Hash Functions Bandwidth-Hard Functions
font style='font-size:12px;'>
2018/3/5
Memory Hard Functions (MHFs) have been proposed as an answer to the growing inequality between the computational speed of general purpose CPUs and Application Specific Integrated Circuits (ASICs). MHF...
Improving the Linear Programming Technique in the Search for Lower Bounds in Secret Sharing
Secret sharing Information inequalities Rank inequalities
font style='font-size:12px;'>
2017/9/25
We present a new improvement in the Linear Programming technique to derive bounds on information theoretic problems. In our case, we deal with the search for lower bounds on the information ratio of s...
Lower bounds on communication for multiparty computation of multiple «AND» instances with secret sharing
information theory secret sharing
font style='font-size:12px;'>
2017/7/6
The present report contains a proof of a linear lower bound for a typical three-party secure computation scheme of nn independent ANDAND functions. The goal is to prove some linear communication lower...
Quantum Collision-Resistance of Non-uniformly Distributed Functions: Upper and Lower Bounds
Quantum Collision Non-uniform distribution
font style='font-size:12px;'>
2017/6/22
We study the quantum query complexity of finding a collision for a function ff whose outputs are chosen according to a non-uniform distribution DD. We derive some upper bounds and lower bounds dependi...