搜索结果: 1-15 共查到“知识库 军事学 independent”相关记录27条 . 查询时间(0.078 秒)
A Key-Independent Distinguisher for 6-round AES in an Adaptive Setting
SPN AES Exchange Attack
2019/8/20
In this paper, we study the results of the recently proposed exchange attack in an adaptive setting. As expected, it leads to present a better 6-round key-independent distinguisher in terms of data an...
Privado: Privacy-Preserving Group-based Advertising using Multiple Independent Social Network Providers
Unlinkability Privacy Advertising
2019/4/11
Online Social Networks (OSNs) offer free storage and social networking services through which users can communicate personal information with one another. The personal information of the users collect...
Theory and application of computationally independent one-way functions: Interactive proof of ability - Revisited
one-way functions zero knowledge proof computational independence
2019/4/1
We introduce the concept of computationally independent pair of one-way functions (CI-OWF). We also provide two rich classes of examples of such functions based on standard assumptions. We revisit two...
Cryptanalysis of CLT13 Multilinear Maps with Independent Slots
Multilinear maps lattice cryptanalysis
2019/3/21
Many constructions based on multilinear maps require independent slots in the plaintext, so that multiple computations can be performed in parallel over the slots. Such constructions are usually based...
Non-profiled Mask Recovery: the impact of Independent Component Analysis
Side Channel Analysis Masking Independent Component Analysis
2018/11/13
As one of the most prevalent SCA countermeasures, masking schemes are designed to defeat a broad range of side channel attacks. An attack vector that is suitable for low-order masking schemes is to tr...
Data-Independent Memory Hard Functions: New Attacks and Stronger Constructions
Memory Hard Function Depth-Robust Graph Sustained Space Complexity
2018/11/7
Data-Independent Memory-hard functions (iMHFs) are a key cryptographic primitive underlying the design of moderately expensive password hashing algorithms and egalitarian proofs of work that are resis...
Platform-independent Secure Blockchain-Based Voting System
blockchain voting ring signature
2018/7/9
Cryptographic techniques are employed to ensure the security of voting systems in order to increase its wide adoption. However, in such electronic voting systems, the public bulletin board that is hos...
Hadamard Matrices, d-Linearly Independent Sets and Correlation-Immune Boolean Functions with Minimum Hamming Weights
Boolean functions Correlation-immune Minimum-weight
2018/3/26
It is known that correlation-immune (CI) Boolean functions used in the framework of side channel attacks need to have low Hamming weights. In 2013, Bhasin et al. studied the minimum Hamming weight of ...
On the Use of Independent Component Analysis to Denoise Side-Channel Measurements
independent component analysis side-channel analysis preprocessing
2018/3/6
Independent Component Analysis (ICA) is a powerful technique for blind source separation. It has been successfully applied to signal processing problems, such as feature extraction and noise reduction...
On the Memory-Hardness of Data-Independent Password-Hashing Functions
password hashing memory hardness
2016/12/10
We show attacks on five data-independent memory-hard functions (iMHF) that were submitted to the password hashing competition. Informally, an MHF is a function which cannot be evaluated on dedicated h...
Constant Round Maliciously Secure 2PC with Function-independent Preprocessing using LEGO
Secure Two-party Computation Implementation LEGO
2016/12/7
Secure two-party computation (S2PC) allows two parties to compute a function on their
joint inputs while leaking only the output of the function. At TCC 2009 Orlandi and Nielsen proposed
the LEGO pr...
Linear-Time Non-Malleable Codes in the Bit-Wise Independent Tampering Model
Non-malleable codes Bit-Wise Independent Tampering Model
2016/4/22
Non-malleable codes were introduced by Dziembowski et al. (ICS 2010) as coding schemes that protect a message against tampering attacks. Roughly speaking, a code is non-malleable if decoding an advers...
We assume a scenario where an attacker can mount several independent attacks on a single CPU. Each attack can be run several times in independent ways. Each attack can succeed after a given number of ...
Efficiently Computing Data-Independent Memory-Hard Functions
Memory Hard Function Password Hashing Depth-Robust Graph
2016/2/23
A memory-hard function (MHF) f is equipped with a {\em space cost} σ and {\em time cost} τ parameter such that repeatedly computing fσ,τ on an application specific integrated circuit (ASIC) is not eco...
More Practical and Secure History-Independent Hash Tables
DRE Secure History-Independent Hash Tables
2016/2/23
Direct-recording electronic (DRE) voting systems have been used in several countries including
United States, India, and the Netherlands to name a few. In the majority of those cases, researchers
di...