搜索结果: 1-15 共查到“军事学 General”相关记录81条 . 查询时间(0.558 秒)
General Linear Group Action on Tensors: A Candidate for Post-Quantum Cryptography
Group actions isomorphism problems signature schemes
2019/6/12
Starting from the one-way group action framework of Brassard and Yung (Crypto '90), we revisit building cryptography based on group actions. Several previous candidates for one-way group actions no lo...
Continuously Non-Malleable Secret Sharing for General Access Structures
Secret sharing Non-malleability Leakage resilience
2019/6/3
We study leakage-resilient continuously non-malleable secret sharing, as recently intro- duced by Faonio and Venturi (CRYPTO 2019). In this setting, an attacker can continuously tamper and leak from a...
Spartan: Efficient and general-purpose zkSNARKs without trusted setup
zkSNARKs transparent zkSNARKs SNARKs
2019/5/23
This paper describes a new public coin, succinct interactive zero-knowledge argument for NP under standard cryptographic hardness assumptions—without requiring a trusted setup. In particular, our argu...
Secret-Sharing Schemes for General and Uniform Access Structures
secret sharing conditional disclosure of secrets protocols private simultaneous messages protocols
2019/3/4
A secret-sharing scheme allows some authorized sets of parties to reconstruct a secret; the collection of authorized sets is called the access structure. For over 30 years, it was known that any (mono...
Four-Round Secure Multiparty Computation from General Assumptions
multi-party computation oblivious transfer round optimal
2019/2/28
In this work we continue the study on the round complexity of secure multi-party computation with black-box simulation in the simultaneous broadcast model where all the parties get the output.
A General Proof Framework for Recent AES Distinguishers
AES Distinguisher Subspace Trail Cryptanalysis
2019/2/26
In this paper, a new framework is developed for proving and adapting the recently proposed multiple-of-8 property and mixture-differential distinguishers. The above properties are formulated as immedi...
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...
Gradient Visualization for General Characterization in Profiling Attacks
Side Channel Analysis Profiling Attacks Deep Learning,
2018/12/19
Past few years have seen the emergence of Machine Learning and Deep Learning algorithms as promising tools for profiling attacks, especially Convolutional Neural Networks (CNN). The latters have indee...
Stronger Leakage-Resilient and Non-Malleable Secret-Sharing Schemes for General Access Structures
Non-malleable secret sharing Leakage-resilient secret sharing Non-malleable extractors
2018/12/3
In this work we present a collection of compilers that take secret sharing schemes for an arbitrary access structures as input and produce either leakage-resilient or non-malleable secret sharing sche...
Non-Malleable Secret Sharing for General Access Structures
Non-Malleable Codes Secret Sharing
2018/8/20
Goyal and Kumar (STOC'18) recently introduced the notion of non-malleable secret sharing. Very roughly, the guarantee they seek is the following: the adversary may potentially tamper with all of the s...
Improved Results on Factoring General RSA Moduli with Known Bits
Factorization General RSA moduli Known bits Integer method
2018/6/25
We revisit the factoring with known bits problem on general RSA moduli in the forms of N=prqsN=prqs for r,s≥1r,s≥1, where two primes pp and qq are of the same bit-size. The relevant moduli are inclusi...
Private Set Intersection with Linear Communication from General Assumptions
PSI cryptographic protocols
2018/3/9
This work presents an improved hashing-based algorithm for Private Set Intersection (PSI) in the honest-but-curious setting. The protocol is generic, modular and provides both asymptotic and concrete ...
A Certain Family of Subgroups of Zn⋆ Is Weakly Pseudo-Free under the General Integer Factoring Intractability Assumption
families of computational groups weak pseudo-freeness abelian groups
2017/11/28
A Certain Family of Subgroups of Zn⋆ Is Weakly Pseudo-Free under the General Integer Factoring Intractability Assumption.
This article appeared as Chapter 5 of the book "Topics in Computational Number Theory inspired by Peter L. Montgomery", edited by Joppe W. Bos and Arjen K. Lenstra and published by Cambridge Universit...
Towards Breaking the Exponential Barrier for General Secret Sharing
Exponential Barrier General Secret Sharing
2017/11/10
A secret-sharing scheme for a monotone Boolean (access) function F:{0,1}n→{0,1}F:{0,1}n→{0,1} is a randomized algorithm that on input a secret, outputs nn shares s1,…,sns1,…,sn such that for any (x1,…...