搜索结果: 1-10 共查到“军事学 Robustness”相关记录10条 . 查询时间(0.102 秒)
The Adversarial Robustness of Sampling
random sampling adversarial model epsilon-approximation
2019/7/8
Random sampling is a fundamental primitive in modern algorithms, statistics, and machine learning, used as a generic method to obtain a small yet ``representative'' subset of the data. In this work, w...
Authenticated ciphers rely on the uniqueness of the nonces to meet their security goals. In this work, we investigate the implications of reusing nonces for three third-round candidates of the ongoing...
Evolving Secret Sharing: Dynamic Thresholds and Robustness
secret sharing evolving access structure robustness
2017/9/28
Threshold secret sharing schemes enable a dealer to share a secret among nn parties such that only subsets of parties of cardinality at least k=k(n)k=k(n) can reconstruct the secret. Komargodski, Naor...
On the Depth-Robustness and Cumulative Pebbling Cost of Argon2i
Argon2i Memory Hard Functions Depth-Robustness
2017/5/25
Argon2i is a data-independent memory hard function that won the password hashing competition. The password hashing algorithm has already been incorporated into several open source crypto libraries suc...
Boosting Authenticated Encryption Robustness With Minimal Modifications
authenticated encryption robust AES
2017/3/13
Secure and highly efficient authenticated encryption (AE) algorithms which achieve data confidentiality and authenticity in the symmetric-key setting have existed for well over a decade. By all conven...
Boolean functions with restricted input and their robustness; application to the FLIP cipher
FLIP Boolean function balance
2017/2/20
We study the main cryptographic features of Boolean functions (balancedness, nonlinearity, algebraic immunity) when, for a given number nn of variables, the input to these functions is restricted to s...
Unconditionally Secure Revocable Storage: Tight Bounds, Optimal Construction, and Robustness
Broadcast encryption information-theoretic security revocable storage
2016/1/27
Data stored in cloud storage sometimes requires long-term security due to its sensitivity (e.g.,
genome data), and therefore, it also requires flexible access control for handling entities who can
u...
Rogue Decryption Failures: Reconciling AE Robustness Notions
provable security authenticated encryption multiple errors
2015/12/23
An authenticated encryption scheme is deemed secure (AE)
if ciphertexts both look like random bitstrings and are unforgeable. AE is
a much stronger notion than the traditional IND–CCA. One shortcomi...
Robustness for Free in Unconditional Multi-Party Computation
Robustness Free Unconditional Multi-Party Computation
2009/4/16
We present a very ecient multi-party computation protocol unconditionally secure
against an active adversary. The security is maximal, i.e., active corruption of up to t < n=3 of
the n players is t...
Extending Oblivious Transfers Efficiently How to get Robustness Almost for Free
Extending Oblivious Transfers Robustness Efficiently
2008/8/25
At Crypto 2003 Ishai et al. gave a protocol which given a small number of (possibly
extremely inefficient) oblivious transfers implements an essentially unbounded number of
oblivious transfers for a...