搜索结果: 1-15 共查到“军事学 Challenge”相关记录21条 . 查询时间(0.049 秒)
Dissecting the CHES 2018 AES Challenge
AES CTF
font style='font-size:12px;'>
2019/7/10
One challenge of the CHES 2018 side channel contest was to break a masked AES implementation. It was impressively won by Gohr et al. by applying ridge regression to obtain guesses for the hamming weig...
Attacking RO-PUFs with Enhanced Challenge-Response Pairs
secret-key cryptography PUF
font style='font-size:12px;'>
2018/11/14
This paper studies the security of Ring Oscillator Physically Unclonable Function (PUF) with Enhanced Challenge-Response Pairs as proposed by Delavar et al. We present an attack that can predict all P...
Public Key Encryption Resilient to Post-Challenge Leakage and Tampering Attacks
After-the-Fact Post-challenge Entropic PKE
font style='font-size:12px;'>
2018/11/13
In this paper, we introduce a new framework for constructing public-key encryption (PKE) schemes resilient to joint post-challenge/after-the-fact leakage and tampering attacks in the bounded leakage a...
How is NATO Meeting the Challenge of Cyberspace
Cyberspace NATO Developing the Toolbox
font style='font-size:12px;'>
2019/10/22
Historians of international relations are familiar with the hinge-year concept when trends that previously had been largely subterranean suddenly crystallize into a clear and immediate danger, forcing...
Creating Cryptographic Challenges Using Multi-Party Computation: The LWE Challenge
lattices learning with errors LWE
font style='font-size:12px;'>
2017/6/27
Practical hardness results are necessary to select parameters for cryptographic schemes. Cryptographic challenges proved to be useful for determining the practical hardness of computational problems t...
Multilateral White-Box Cryptanalysis: Case study on WB-AES of CHES Challenge 2016
hite-Box Cryptanalysis Side-Channel Attack Software Implementation
font style='font-size:12px;'>
2016/12/10
The security requirement of white-box cryptography (WBC) is that it should protect the secret key from a white-box security model that permits an adversary who is able to entirely control the executio...
Efficient IBE with Tight Reduction to Standard Assumption in the Multi-challenge Setting
Identity based encryption Tight security Nested dual system group
font style='font-size:12px;'>
2016/12/9
In 2015, Hofheinz et al. [PKC, 2015] extended Chen and Wee's almost-tight reduction technique for identity based encryptions (IBE) [CRYPTO, 2013] to the multi-instance, multi-ciphertext (MIMC, or mult...
A Genetic Algorithm for Searching Shortest Lattice Vector of SVP Challenge
Shortest Vector Problem (SVP) Genetic Algorithm Chromesome
font style='font-size:12px;'>
2016/1/9
In this paper, we propose a genetic algorithm for solving the shortest vector problem
(SVP) based on sparse integer representations of short vectors in lattices as chromesomes, which,
we prove, can ...
Concise Multi-Challenge CCA-Secure Encryption and Signatures with Almost Tight Security
CCA-secure encryption multi-user multi-challenge
font style='font-size:12px;'>
2016/1/7
To gain strong confidence in the security of a public-key scheme, it is most desirable for the
security proof to feature a tight reduction between the adversary and the algorithm solving the underlyi...
Bitline PUF: Building Native Challenge-Response PUF Capability into Any SRAM
Physical Unclonable Functions future research
font style='font-size:12px;'>
2016/1/7
Physical Unclonable Functions (PUFs) are specialized circuits with applications including key generation and challenge-response authentication. PUF properties such as low cost and resistance to invasi...
A Fast Phase-Based Enumeration Algorithm for SVP Challenge through y-Sparse Representations of Short Lattice Vectors
public-key cryptography Lattice-based Xryptography
font style='font-size:12px;'>
2016/1/5
In this paper, we propose a new phase-based enumeration algorithm based on two
interesting and useful observations for y-sparse representations of short lattice vectors in lattices
from SVP challeng...
MQ Challenge: Hardness Evaluation of Solving Multivariate Quadratic Problems
post-quantum cryptography multivariate public-key cryptosystem MQ problem
font style='font-size:12px;'>
2016/1/3
Multivariate Quadratic polynomial (MQ) problem serve as the basis of security
for potentially post-quantum cryptosystems. The hardness of solving MQ problem depends
on a number of parameters, most i...
A Challenge Obfuscation Method for Thwarting Model Building Attacks on PUFs
Physical Uncloanble Function obfuscation
font style='font-size:12px;'>
2015/12/30
Physical Unclonable Functions (PUFs), as novel lightweight
hardware security primitives, provide a higher level security with lower
power and area overhead in comparison with traditional cryptograph...
Security analysis of Quantum-Readout PUFs in the case of challenge-estimation attacks
PUF quantum security
font style='font-size:12px;'>
2014/3/11
Quantum Readout PUFs (QR-PUFs) have been proposed as a technique for remote authentication of ob jects. The security is based on basic quantum information theoretic principles and the assumption that ...
Off-Path Hacking: The Illusion of Challenge-Response Authentication
challenge-response defenses cryptographic protocols
font style='font-size:12px;'>
2014/3/7
Everyone is concerned about Internet security, yet most traffic is not cryptographically protected. Typical justification is that most attackers are off-path and cannot intercept traffic; hence, intui...