搜索结果: 1-7 共查到“军事学 Partitioning”相关记录7条 . 查询时间(0.018 秒)
Asymptotically Compact Adaptively Secure Lattice IBEs and Verifiable Random Functions via Generalized Partitioning Techniques
identity-based encryption verifiable random function adaptive security
2017/2/20
In this paper, we focus on the constructions of adaptively secure identity-based encryption (IBE) from lattices and verifiable random function (VRF) with large input spaces. Existing constructions of ...
Partitioning via Non-Linear Polynomial Functions: More Compact IBEs from Ideal Lattices and Bilinear Maps
Ring LWE Bilinear Maps Identity-Based Encryption
2016/12/10
In this paper, we present new adaptively secure identity-based encryption (IBE) schemes. One of the distinguishing property of the schemes is that it achieves shorter public parameters than previous s...
Adaptive partitioning
Tight security reductions pairing-friendly groups decisional composite residuosity
2016/4/15
A public-key encryption scheme whose chosen-ciphertext security can be tightly reduced to the DLIN assumption in a pairing-friendly group. Ciphertexts, public keys, and system parameters contain 6, 24...
Tightly-Secure Pseudorandom Functions via Work Factor Partitioning
Tight security pseudorandom functions provable security
2016/2/23
We introduce a new technique for tight security proofs called work
factor partitioning. Using this technique in a modified version of the framework
of Dottling and Schr ¨ oder (CRYPTO 2015), we obta...
Algebraic partitioning: Fully compact and (almost) tightly secure cryptography
Partitioning arguments tight security proofs digital signatures
2015/12/30
We describe a new technique for conducting “partitioning arguments”. Partitioning arguments
are a popular way to prove the security of a cryptographic scheme. For instance, to prove
the security of ...
Differential and Linear Cryptanalysis of ARX with Partitioning -- Application to FEAL and Chaskey
Differential cryptanalysis linear cryptanalysis ARX
2015/12/22
In this work, we refine a partitioning technique recently
proposed by Biham and Carmeli to improve the linear cryptanalysis
of addition operations, and we propose an analogue improvement of
differe...
Improved Algebraic Cryptanalysis of QUAD, Bivium and Trivium via Graph Partitioning on Equation Systems
public-key cryptography algebraic attacks graph partitioning polynomial equations Trivium QUAD
2010/7/14
We present a novel approach for solving systems of polynomial equations via graph partitioning. The concept of a variable-sharing graph of a system of polynomial equations is defined. If such graph is...