搜索结果: 1-15 共查到“军事学 Short”相关记录113条 . 查询时间(0.036 秒)
Forkcipher: a New Primitive for Authenticated Encryption of Very Short Messages
Authenticated encryption new primitive forkcipher
2019/9/6
Highly efficient encryption and authentication of short messages is an essential requirement for enabling security in constrained scenarios such as the CAN FD in automotive systems (max. message size ...
On the Non-Existence of Short Vectors in Random Module Lattices
Lattice-based cryptography Fiat-Shamir signatures module lattices
2019/8/30
Recently, Lyubashevsky & Seiler (Eurocrypt 2018) showed that small polynomials in the cyclotomic ring Zq[X]/(Xn+1)Zq[X]/(Xn+1), where nn is a power of two, are invertible under special congruence cond...
In this article, we propose new heuristics for minimizing the amount of XOR gates required to compute a system of linear equations in GF(2). We first revisit the well known Boyar-Peralta strategy and ...
k-root-n: An efficient O(√n) algorithm for avoiding short term double spending in Distributed Ledger Technologies such as Blockchain
Blockchain bitcoin distributed ledger technology
2019/7/17
Blockchains such as bitcoin rely on reaching global consensus for the distributed ledger, and suffer from a well know scalability problem. We propose an algorithm which can avoid double spending in th...
Current blockchains are restricted by the low throughput. Aimed at this problem, we propose Txilm, a protocol that compresses the size of transaction presentation in each block and thus saves the band...
Algebraic Techniques for Short(er) Exact Lattice-Based Zero-Knowledge Proofs
Lattices Zero-Knowledge Proofs Commitments
2019/6/4
A key component of many lattice-based protocols is a zero-knowledge proof of knowledge of a vector s⃗ s→ with small coefficients satisfying As⃗ =u⃗ modqAs→=u→modq. While there exist ...
Elastic-Tweak: A Framework for Short Tweak Tweakable Block Cipher
tweakable block cipher GIFT AES
2019/5/5
Tweakable block cipher (TBC), a stronger notion than standard block ciphers, has wide-scale applications in symmetric-key schemes. At a high level, it provides flexibility in design and (possibly) bet...
Hierarchical Attribute-based Signatures: Short Keys and Optimal Signature Length
Attribute-based Signatures delegation hierarchy path anonymity
2019/4/16
With Attribute-based Signatures (ABS) users can simultaneously sign messages and prove compliance of their attributes, issued by designated attribute authorities, with some verification policy. Neithe...
Short Discrete Log Proofs for FHE and Ring-LWE Ciphertexts
Zero-Knowledge Proofs Bulletproofs FHE
2019/1/26
In applications of fully-homomorphic encryption (FHE) that involve computation on encryptions produced by several users, it is important that each user proves that her input is indeed well-formed. Thi...
Hunting and Gathering - Verifiable Random Functions from Standard Assumptions with Short Proofs
public-key cryptography verifiable random functions
2019/1/18
A verifiable random function (VRF) is a pseudorandom function, where outputs can be publicly verified. That is, given an output value together with a proof, one can check that the function was indeed ...
Group signature is a central tool for privacy-preserving protocols, ensuring authentication, anonymity and accountability. It has been massively used in cryptography, either directly or through varian...
Forking a Blockcipher for Authenticated Encryption of Very Short Messages
Authenticated encryption short messages lightweight cryptography
2018/11/8
Highly efficient encryption and authentication of short messages has been identified as an essential requirement for enabling security in constrained computation and communication scenarios such as th...
Efficient Multi-key FHE with short extended ciphertexts and less public parameters
Multi-key FHE BGV scheme ciphertext extension
2018/11/2
Multi-Key Full Homomorphic Encryption scheme (MKFHE) can perform arbitrary operation on encrypted data under different public keys (users), and the final ciphertext can be jointly decrypted. Therefore...
Short Lattice-based One-out-of-Many Proofs and Applications to Ring Signatures
lattice-based cryptography zero-knowledge proof ring signature
2018/8/28
In this work, we construct a short one-out-of-many proof from (Module-SIS) lattices, allowing one to prove knowledge of a secret associated with one of the public values in a set. The proof system fol...
Recovering short secret keys of RLCE in polynomial time
Code-based Cryptography McEliece encryption scheme key recovery attack
2018/6/5
We present a key recovery attack against Y. Wang's Random Linear Code Encryption (RLCE) scheme recently submitted to the NIST call for post-quantum cryptography. This attack recovers the secret key fo...