搜索结果: 16-30 共查到“军事学 Applications”相关记录384条 . 查询时间(0.14 秒)
Homomorphism learning problems and its applications to public-key cryptography
Learning With Errors isogenies non-commutative cryptography
2019/6/19
We present a framework for the study of a learning problem over abstract groups, and introduce a new technique which allows for public-key encryption using generic groups. We proved, however, that in ...
On Deploying Secure Computing Commercially: Private Intersection-Sum Protocols and their Business Applications
secure computation private intersection-sum secure aggregate ad conversion
2019/6/19
In this work, we describe how to deploy a cryptographic secure computation protocol for routine use in industry. Based on our experience, we identify major preliminaries and enabling factors which we ...
We describe an efficient linkable ring signature scheme, compact linkable spontaneous anonymous group (CLSAG) signatures, for use in confidential transactions. Compared to the existing signature schem...
Agree-and-Prove: Generalized Proofs Of Knowledge and Applications
PoK Knowledge and Applications
2019/6/5
Proofs of knowledge (PoK) are one of the most fundamental notions in cryptography and have been used as a building block in numerous applications. The appeal of this notion is that it is parameterized...
Non-Uniformly Sound Certificates with Applications to Concurrent Zero-Knowledge
non-uniform certificates concurrent zero-knowledge
2019/6/4
We introduce the notion of non-uniformly sound certificates: succinct single-message (unidirectional) argument systems that satisfy a ``best-possible security'' against non-uniform polynomial-time att...
Time-lock puzzles allow one to encrypt messages for the future, by efficiently generating a puzzle with a solution ss that remains hidden until time TT has elapsed. The solution is required to be conc...
On the Distribution of Quadratic Residues and Non-residues Modulo Composite Integers and Applications to Cryptography
Jacobi symbol probability distribution statistical distance
2019/6/4
We develop exact formulas for the distribution of quadratic residues and non-residues in sets of the form a+X={(a+x)modn∣x∈X}a+X={(a+x)modn∣x∈X}, where nn is a prime or the product of two primes and X...
We introduce a new primitive, called trapdoor hash functions (TDH), which are hash functions H:{0,1}n→{0,1}secH:{0,1}n→{0,1}sec with additional trapdoor function-like properties. Specifically, given a...
New Primitives for Actively-Secure MPC over Rings with Applications to Private Machine Learning
MPC Decision Trees SVM
2019/6/3
At CRYPTO 2018 Cramer et al. presented SPDZ2k, a new secret-sharing based protocol for actively secure multi-party computation against a dishonest majority, that works over rings instead of fields. Th...
Security in the Presence of Key Reuse: Context-Separable Interfaces and their Applications
Key-reuse APIs Diffie-Hellman EdDSA
2019/5/21
Key separation is often difficult to enforce in practice. While key reuse can be catastrophic for security, we know of a number of cryptographic schemes for which it is provably safe. But existing for...
Lattice-based Zero-Knowledge Proofs: New Techniques for Shorter and Faster Constructions and Applications
lattice-based cryptography zero-knowledge proof CRT packing, ring signature
2019/5/9
We devise new techniques for design and analysis of efficient lattice-based zero-knowledge proofs (ZKP). First, we introduce one-shot proof techniques for non-linear polynomial relations of degree k≥2...
Field Extension in Secret-Shared Form and Its Applications to Efficient Secure Computation
secure computation secret sharing, active security
2019/4/16
Secure computation enables participating parties to jointly compute a function over their inputs while keeping them private. Secret sharing plays an important role for maintaining privacy during the c...
Designated-verifier pseudorandom generators, and their applications
non-interactive zero-knowledge computational Diffie-Hellman learning with errors
2019/3/4
We provide a generic construction of non-interactive zero-knowledge (NIZK) schemes. Our construction is a refinement of Dwork and Naor’s (FOCS 2000) implementation of the hidden bits model using verif...
TEDT, a Leakage-Resilient AEAD mode for High (Physical) Security Applications
Authenticated encryption re-keying tweakable block cipher
2019/2/26
We propose TEDT, a new Authenticated Encryption with Associated Data (AEAD) mode leveraging Tweakable Block Ciphers (TBCs). TEDT provides the following features: (i) It offers asymptotically optimal s...
Updatable Anonymous Credentials and Applications to Incentive Systems
anonymity anonymous credentials incentive systems
2019/2/25
In this paper, we introduce updatable anonymous credential systems (UACS) and use them to construct a new privacy-preserving incentive system. In a UACS, a user holding a credential certifying some at...