搜索结果: 1-15 共查到“军事学 bounds”相关记录108条 . 查询时间(0.156 秒)
Security-Efficiency Tradeoffs in Searchable Encryption -- Lower Bounds and Optimal Constructions
searchable encryption lower bound
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, ...
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...
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
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...
Variants of the AES Key Schedule for Better Truncated Differential Bounds
AES Key schedule Related-key Truncated Differential
2019/2/27
Differential attacks are one of the main ways to attack block ciphers. Hence, we need to evaluate the security of a given block cipher against these attacks. One way to do so is to determine the minim...
Tight Security Bounds for Generic Stream Cipher Constructions
Stream Ciphers Generic Time-Memory-Data Tradeoff Attacks Security Lower Bound Proofs
2019/1/9
The design of modern stream ciphers is strongly influenced by the fact that Time-Memory-Data tradeoff attacks (TMD-TO attacks) reduce their effective key length to SL/2SL/2, where SLSL denotes the inn...
Further Lower Bounds for Structure-Preserving Signatures in Asymmetric Bilinear Groups
public-key cryptography Structure-Preserving Signatures
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...
The Multi-user Security of GCM, Revisited: Tight Bounds for Nonce Randomization
cryptographic protocols Nonce Randomization
2018/11/5
Multi-user (mu) security considers large-scale attackers (e.g., state actors) that given access to a number of sessions, attempt to compromise {\em at least} one of them. Mu security of authenticated ...
Lower Bounds for Differentially Private RAMs
oblivious RAM differential privacy lower bounds
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
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...
Issue, Trade, Redeem: Crossing Systems Bounds with Cryptocurrency-Backed Tokens
Bitcoin Ethereum blockchain
2018/7/9
The ecosystem of cryptocurrencies has been steadily growing since the introduction of Bitcoin, the first decentralised digital currency. While the notion of trustless asset exchange lies at the core o...
Lower Bounds on Lattice Enumeration with Extreme Pruning
Lattices Enumeration Pruning Security Estimates
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
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 ...
Enforcing ideal-world leakage bounds in real-world secret sharing MPC frameworks
Domain-specific languages Privacy Security
2018/5/11
We give a language-based security treatment of domain-specific languages and compilers for secure multi-party computation, a cryptographic paradigm that enables collaborative computation over encrypte...
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 ...