搜索结果: 1-15 共查到“军事学 Characterization”相关记录25条 . 查询时间(0.132 秒)
A Fast Characterization Method for Optical Fault Injection
Physical attacks Fault injection Fast space characterization
font style='font-size:12px;'>
2019/7/26
Semi-invasive fault injection attacks, such as optical fault injection, are powerful techniques well-known by attackers and secure embedded system designers. When performing such attacks, the selectio...
Channels of Small Log-Ratio Leakage and Characterization of Two-Party Differentially Private Computation
oblivious transfer differential privacy hardness amplification
font style='font-size:12px;'>
2019/6/4
Consider a PPT two-party protocol Π=(A,B)Π=(A,B) in which the parties get no private inputs and obtain outputs OA,OB∈{0,1}OA,OB∈{0,1}, and let VAVA and VBVB denote the parties' individual views. Proto...
Gradient Visualization for General Characterization in Profiling Attacks
Side Channel Analysis Profiling Attacks Deep Learning,
font style='font-size:12px;'>
2018/12/19
Past few years have seen the emergence of Machine Learning and Deep Learning algorithms as promising tools for profiling attacks, especially Convolutional Neural Networks (CNN). The latters have indee...
ExpFault: An Automated Framework for Exploitable Fault Characterization in Block Ciphers
Fault attack Block cipher Automation
font style='font-size:12px;'>
2018/3/30
Malicious exploitation of faults for extracting secrets is one of the most practical and potent threats to modern cryptographic primitives. Interestingly, not every possible fault for a cryptosystem i...
Automatic Characterization of Exploitable Faults: A Machine Learning Approach
Security Block Cipher Fault Attack
font style='font-size:12px;'>
2017/10/16
Characterization of the fault space of a cipher to filter out a set of faults potentially exploitable for fault attacks (FA), is a problem with immense practical value. A quantitative knowledge of the...
Towards a Characterization of the Related-Key Attack Security of the Iterated Even-Mansour Cipher
Iterated Even-Mansour cipher related-key attack
font style='font-size:12px;'>
2016/7/20
We prove the related-key security of the Iterated Even-Mansour cipher under broad classes of related key derivation (RKD) functions. Our result extends the classes of RKD functions considered by Farsh...
Complete characterization of generalized bent and 2^k-bent Boolean functions
Boolean functions 2k-bent Boolean functions
font style='font-size:12px;'>
2016/4/7
In this paper we investigate properties of generalized bent Boolean functions and 2k-bent (i.e., negabent, octabent, hex- adecabent, et al.) Boolean functions in a uniform framework. We generalize the...
Spectral characterization of iterating lossy mappings
iterative lossy mappings correlation matrices non-uniformity
font style='font-size:12px;'>
2016/2/23
In this paper we study what happens to sets when we iteratively apply lossy (round) mappings
to them. We describe the information loss as imbalances of parities of intermediate distributions
and sho...
Characterization of EME with Linear Mixing
EME PRP OLPRP
font style='font-size:12px;'>
2016/1/26
Encrypt-Mix-Encrypt is a type of SPRP based construction,
where a masked plaintext is encrypted in ECB mode of, then a non-linear
mixing is performed and then again an encryption is performed in ECB...
A Full Characterization of Completeness for Two-party Randomized Function Evaluation
Foundations Secure 2-party Randomized Function Evaluation Completeness Characterization
font style='font-size:12px;'>
2016/1/26
We settle a long standing open problem which has pursued a full characterization of completeness of
(potentially randomized) finite functions for 2-party computation that is secure against active adv...
Physical Characterization of Arbiter PUFs
Physical Characterization Arbiter PUFs
font style='font-size:12px;'>
2016/1/6
As intended by its name, Physically Unclonable Functions (PUFs) are considered as an ultimate solution to deal with insecure stor- age, hardware counterfeiting, and many other security problems. How- ...
Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions
Fairness secure two-party computation foundations
font style='font-size:12px;'>
2016/1/5
Fairness is a desirable property in secure computation; informally it means that if one party gets the output of the function, then all parties get the output. Alas, an implication of Cleve's result (...
Characterization of MDS mappings
MDS map MDS code MDS matrix
font style='font-size:12px;'>
2016/1/5
MDS codes and matrices are closely related to combinatorial
objects like orthogonal arrays and multipermutations.
Conventional MDS codes and matrices were defined on finite fields,
but several gene...
Characterization of Secure Multiparty Computation Without Broadcast
broadcast point-to-point communication multiparty computation
font style='font-size:12px;'>
2015/12/23
A major challenge in the study of cryptography is characterizing the necessary and sufficient assumptions required to carry out a given cryptographic task. The focus of this work is the necessity of a...
A Complete and Linear Physical Characterization Methodology for the Arbiter PUF Family
Physically Unclonable Function Arbiter PUF Photonic emission analysis
font style='font-size:12px;'>
2015/12/23
As intended by its name, Physically Unclonable Functions
(PUFs) are considered as an ultimate solution to deal with insecure storage,
hardware counterfeiting, and many other security problems. Howev...