搜索结果: 1-7 共查到“军队指挥学 Randomization”相关记录7条 . 查询时间(0.051 秒)
On Kilian's Randomization of Multilinear Map Encodings
Multilinear maps key-exchange Approximate-GCD problem
font style='font-size:12px;'>
2018/11/29
Indistinguishability obfuscation constructions based on matrix branching programs generally proceed in two steps: first apply Kilian's randomization of the matrix product computation, and then encode ...
The Multi-user Security of GCM, Revisited: Tight Bounds for Nonce Randomization
cryptographic protocols Nonce Randomization
font style='font-size:12px;'>
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 ...
The Strength of Weak Randomization: Efficiently Searchable Encryption with Minimal Leakage
efficiently searchable encryption encrypted databases
font style='font-size:12px;'>
2017/11/13
Efficiently searchable and easily deployable encryption schemes enable an untrusted, legacy service such as a relational database engine to perform searches over encrypted data. The ease with which su...
Revisiting the Wrong-Key-Randomization Hypothesis
linear cryptanalysis wrong-key-randomization hypothesis success probability
font style='font-size:12px;'>
2016/12/8
Linear cryptanalysis can be considered to be one of the
strongest techniques in the cryptanalyst’s arsenal. In most cases, Matsui’s
Algorithm 2 is used for the key recovery part of the attack. The s...
T-Proof: Secure Communication via Non-Algorithmic Randomization
identity theft non-repeat identification dialogue
font style='font-size:12px;'>
2016/5/20
shared random strings are either communicated or recreated algorithmically in “pseudo” mode, thereby exhibiting innate vulnerability. Proposing a secure protocol based on unshared randomized data, whi...
Groth-Sahai Proofs Revisited Again: A Bug in Randomization
Non-interactive proof systems the Groth-Sahai proof system symmetric bilinear groups
font style='font-size:12px;'>
2016/5/20
We revisit randomization of the prover in the GS proof system. We find an unnoticed bug in the ``optimized'' randomization in the symmetric bilinear setting with several assumptions, say, the DLIN ass...
Encrypted Secret Sharing and Analysis by Plaintext Randomization
secret sharing reduction
font style='font-size:12px;'>
2014/3/13
In this paper we consider the problem of secret sharing where shares are encrypted using a public-key encryption (PKE) scheme and ciphertexts are publicly available. While intuition tells us that the ...