搜索结果: 1-15 共查到“军事学 Cryptographic Primitives”相关记录17条 . 查询时间(0.093 秒)
Improved Interpolation Attacks on Cryptographic Primitives of Low Algebraic Degree
Block cipher Cryptanalysis Interpolation attack
2019/7/15
Symmetric cryptographic primitives with low multiplicative complexity have been proposed to improve the performance of emerging applications such as secure Multi-Party Computation. However, primitives...
A software watermarking scheme enables users to embed a message or mark within a program while preserving its functionality. Moreover, it is difficult for an adversary to remove a watermark from a mar...
New Number-Theoretic Cryptographic Primitives
rth-power residue symbol rth-order imprint prq moduli
2019/5/14
This paper introduces new p^rq-based one-way functions and companion signature schemes. The new signature schemes are interesting because they do not belong to the two common design blueprints, which ...
MARVELlous: a STARK-Friendly Family of Cryptographic Primitives
cryptanalysis block ciphers hash functions
2018/11/16
The ZK-STARK technology, published by Ben-Sasson et al. in ePrint 2018/046 is hailed by many as being a viable, efficient solution to the scaling problem of cryptocurrencies. In essence, a ZK-STARK pr...
Towards Lightweight Cryptographic Primitives with Built-in Fault-Detection
design of cryptographic primitives fault injection countermeasures side-channel attack
2018/8/10
We introduce a novel approach for designing symmetric ciphers to resist fault injection. The approach is fairly generic and applies to round functions of block ciphers, cryptographic permutations and ...
On the Bit Security of Cryptographic Primitives
Bit Security Information Theory Indistinguishability
2018/1/19
We introduce a formal quantitative notion of ``bit security'' for a general type of cryptographic games (capturing both decision and search problems), aimed at capturing the intuition that a cryptogra...
Blockwise p-Tampering Attacks on Cryptographic Primitives, Extractors, and Learners
Tampering Extractors Adversarial Learning
2017/9/28
Austrin, Chung, Mahmoody, Pass and Seth (Crypto'14) studied the notion of bitwise pp-tampering attacks over randomized algorithms in which an efficient `virus' gets to control each bit of the randomne...
Forward and Backward Private Searchable Encryption from Constrained Cryptographic Primitives
symmetric searchable encryption provable security implementation
2017/8/29
Using dynamic Searchable Symmetric Encryption, a user with limited storage resources can securely outsource a database to an untrusted server, in such a way that the database can still be searched and...
sLiSCP: Simeck-based Permutations for Lightweight Sponge Cryptographic Primitives
Lightweight cryptography Cryptographic permutation Simeck block cipher
2017/8/10
In this paper, we propose a family of lightweight cryptographic permutations called sLiSCP, with the sole aim to provide a realistic minimal design}that suits a variety of lightweight device applicati...
On Constrained Implementation of Lattice-based Cryptographic Primitives and Schemes on Smart Cards
Authentication protocol constrained device constrained implementation
2016/1/8
Most lattice-based cryptographic schemes with a security proof suffer from large key
sizes and heavy computations. This is also true for the simpler case of authentication protocols
which are used o...
FPGA Trojans through Detecting and Weakening of Cryptographic Primitives
Hardware security FPGAs Trojans
2016/1/7
This paper investigates a novel attack vector against cryptography realized on FPGAs, which poses a serious threat to real-world applications.We demonstrate how a targeted bitstream modification can s...
Four Neighbourhood Cellular Automata as Better Cryptographic Primitives
Cellular Automata nonlinearity CA rule 30
2015/12/25
Three-neighbourhood Cellular Automata (CA) are widely
studied and accepted as suitable cryptographic primitive. Rule 30, a
3-neighbourhood CA rule, was proposed as an ideal candidate for cryptograph...
On the Power of Pair Encodings: Frameworks for Predicate Cryptographic Primitives
Pair encodings predicate encryption predicate signature
2015/12/22
Recently Attrapadung (Eurocrypt 2014) proposed a generic framework for fully (adaptively) secure
predicate encryption (PE) based on a new primitive, called pair encodings. The authors shows that if
...
Public-Key Cryptographic Primitives Provably as Secure as Subset Sum
Public-Key Cryptographic Primitives Secure Subset Sum
2009/12/29
We propose a semantically-secure public-key encryption scheme whose security is polynomial-
time equivalent to the hardness of solving random instances of the subset sum problem. The subset sum
assu...
Towards a Uniform Description of Several Group Based Cryptographic Primitives
Uniform Description Several Group Cryptographic Primitives
2009/4/14
The public key cryptosystems MST1 and MST2 make use of certain
kinds of factorizations of finite groups. We show that generalizing such
factorizations to infinite groups allows a uniform description...