搜索结果: 1-10 共查到“密码学 DFA”相关记录10条 . 查询时间(0.109 秒)
ABE for DFA from k-Lin
ABE DFA
2019/6/4
We present the first attribute-based encryption (ABE) scheme for deterministic finite automaton (DFA) based on static assumptions in bilinear groups; this resolves an open problem posed by Waters (CRY...
Recently, the NIST launched a competition for lightweight cryptography and a large number of ciphers are expected to be studied and analyzed under this competition. Apart from the classical security, ...
CRAFT: Lightweight Tweakable Block Cipher with Efficient Protection Against DFA Attacks
CRAFT block cipher tweakable
2019/2/28
Traditionally, countermeasures against physical attacks are integrated into the implementation of cryptographic primitives after the algorithms have been designed for achieving a certain level of cryp...
A First DFA on PRIDE: from Theory to Practice (extended version)
implementation cryptanalysis
2017/2/20
PRIDE is one of the most effcient lightweight block cipher proposed so far for connected objects with high performance and low resource constraints. In this paper we describe the first ever complete D...
DFA on LS-Designs with a Practical Implementation on SCREAM (extended version)
implementation cryptanalysis
2017/2/20
LS-Designs are a family of SPN-based block ciphers whose linear layer is based on the so-called interleaved construction. They will be dedicated to low-end devices with high performance and low-resour...
DFA-Based Functional Encryption: Adaptive Security from Dual System Encryption
deterministic finite automata FE over regular languages
2014/3/7
We present an adaptively secure functional encryption (FE) scheme based on deterministic finite automata (DFA). The construction uses composite-order bilinear pairings and is built upon the selectivel...
An Efficient Protocol for Oblivious DFA Evaluation and Applications
cryptographic protocols / secure computation secure pattern matching
2012/3/26
In this paper, we design an efficient protocol for \emph{oblivious DFA evaluation} between an input holder (client) and a DFA holder (server). The protocol runs in a single round, and only requires a ...
Fault-propagation Pattern Based DFA on SPN Structure Block Ciphers using Bitwise Permutation, with Application to PRESENT and PRINTcipher
Fault-propagation pattern fault-propagation path differential fault analysis bitwise permutation SPN block cipher PRESENT PRINTcipher
2012/3/29
This paper proposes a novel fault-propagation pattern based differential fault analysis method - FPP-DFA, and proves its feasibility on SPN structure block ciphers using bitwise permutation, such as P...
Fault Propagate Pattern Based DFA on SPN Structure Block Ciphers using Bitwise Permutation, with Application to PRESENT and PRINTcipher
fault propagate pattern fault propagate path differential fault analysis bitwise permutation SPN block cipher PRESENT PRINTcipher
2011/2/24
PRESENT and PRINTcipher are two hardware-optimized ultra-lightweight block ciphers presented in CHES 2007 and CHES 2010, which is suitable for RFID tags and IC-Printing, the authors didn’t analyze the...
At CHES 2003, Piret and Quisquater published a very efficient DFA on AES which has served as a basis for many variants published afterwards. In this paper, we revisit P&Q's DFA on AES and we explain h...