搜索结果: 1-15 共查到“军事学 reduction”相关记录64条 . 查询时间(0.118 秒)
A Reduction-Based Proof for Authentication and Session Key Security in 3-Party Kerberos
Kerberos authenticated key exchange
2019/7/10
Kerberos is one of the earliest network security protocols, providing authentication between clients and servers with the assistance of trusted servers. It remains widely used, notably as the default ...
The General Sieve Kernel and New Records in Lattice Reduction
cryptanalysis lattice reduction sieving
2019/1/29
We propose the General Sieve Kernel (G6K, pronounced /ʒe.si.ka/), an abstract stateful machine supporting a wide variety of lattice reduction strategies based on sieving algorithms. Using the bas...
LWE Without Modular Reduction and Improved Side-Channel Attacks Against BLISS
LWE problem lattice-based cryptography side-channel analysis
2018/11/19
Our interest in studying this problem stems from the side-channel attack against the BLISS lattice-based signature scheme described by Espitau et al. at CCS 2017. The attack targets a quadratic functi...
State-Separating Proofs: A Reduction Methodology for Real-World Protocols
composition verification key exchange
2018/4/4
The security analysis of real-world protocols involves reduction steps that are conceptually simple but have to handle complicated protocol details. Taking inspiration from Universal Composability, Ab...
Towards Fully Automated Analysis of Whiteboxes: Perfect Dimensionality Reduction for Perfect Leakage
whitebox cryptanalysis security evaluation
2018/1/29
Differential computation analysis (DCA) is a technique recently introduced by Bos et al. and Sanfelix et al. for key recovery from whitebox implementations of symmetric ciphers. It consists in applyin...
A Simple Reduction from State Machine Replication to Binary Agreement in Partially Synchronous or Asynchronous Networks
SMR BA
2018/1/17
The recent advent of blockchains has spurred a huge interest in the research and development of numerous cryptocurrencies as well as understanding the fundamental concepts that underly this technology...
Fast Lattice Basis Reduction Suitable for Massive Parallelization and Its Application to the Shortest Vector Problem
lattice basis reduction massive parallelization shortest vector problem
2018/1/11
The hardness of the shortest vector problem for lattices is a fundamental assumption underpinning the security of many lattice-based cryptosystems, and therefore, it is important to evaluate its diffi...
A Constant-Size Signature Scheme with a Tighter Reduction from the CDH Assumption
digital signatures the CDH assumption trapdoor commitments
2017/11/22
We present a signature scheme with the tightest security-reduction among known constant-size signature schemes secure under the computational Diffie-Hellman (CDH) assumption. It is important to reduce...
Entropy Reduction for the Correlation-Enhanced Power Analysis Collision Attack
AES Side Channel Attacks
2017/11/13
Side Channel Attacks are an important attack vector on secure AES implementations. The Correlation-Enhanced Power Analysis Collision Attack by Moradi et al. [13] is a powerful collision attack that ex...
A tight security reduction in the quantum random oracle model for code-based signature schemes
Quantum Random Oracle Quantum-Safe Cryptography Code-Based Cryptography
2017/9/28
Quantum secure signature schemes have a lot of attention recently, in particular because of the NIST call to standardize quantum safe cryptography. However, only few signature schemes can have concret...
In the implementation of many public key schemes, there is a need to implement modular arithmetic. Typically this consists of addition, subtraction, multiplication and (occasionally) division with res...
Improved Reduction from the Bounded Distance Decoding Problem to the Unique Shortest Vector Problem in Lattices
Lattices Bounded Distance Decoding Problem Unique Shortest Vector Problem
2016/12/12
We present a probabilistic polynomial-time reduction from the lattice Bounded Distance Decoding (BDD) problem with parameter 1/(2√⋅γ2⋅γ) to the unique Shortest Vector Problem (uSVP) with p...
We describe an asymptotically fast variant of the LLL lattice reduction algorithm. It takes as input a basis B∈Zn×nB∈Zn×n and returns a (reduced) basis CC of the Euclidean lattice LL spanned by BB, wh...
Efficient IBE with Tight Reduction to Standard Assumption in the Multi-challenge Setting
Identity based encryption Tight security Nested dual system group
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...
Iterated Random Oracle: A Universal Approach for Finding Loss in Security Reduction
Random Oracle Indistinguishability Security under Computational Assumptions Finding Loss
2016/12/9
The indistinguishability security of a public-key cryptosystem can be reduced to a computational hard assumption in the random oracle model, where the solution to a computational hard problem is hidde...