搜索结果: 1-15 共查到“军事学 Randomized”相关记录28条 . 查询时间(0.093 秒)
On the Round Complexity of Randomized Byzantine Agreement
Byzantine agreement lower bound round complexity
2019/7/31
We prove lower bounds on the round complexity of randomized Byzantine agreement (BA) protocols, bounding the halting probability of such protocols after one and two rounds.
Efficient Secure Ridge Regression from Randomized Gaussian Elimination
multiparty computation privacy-preserving machine learning secure ridge regression
2019/7/8
In this paper we present a practical protocol for secure ridge regression. We develop the necessary secure linear algebra tools, using only basic arithmetic over prime fields. In particular, we will s...
Freestyle, a randomized version of ChaCha for resisting offline brute-force and dictionary attacks
Brute-force resistant ciphers Dictionary based attacks Key-guessing penalty
2018/11/29
This paper introduces Freestyle, a randomized, and variable round version of the ChaCha cipher. Freestyle demonstrates the concept of hash based halting condition, where a decryption attempt with an i...
Evaluation of Resilience of randomized RNS implementation
RNS moduli randomization Monte Carlo
2018/1/12
Since Hamming distances have gaussian distribution and most of the statistic tests, like NIST's ones, evaluate discrete and uniform distribution, we choose to use side-channel attacks as a tool in ord...
Towards an in-depth understanding of privacy parameters for randomized sanitization mechanisms
Anonymity Differential Privacy
2017/9/18
Differential privacy, and close other notions such as dχdχ-privacy, is at the heart of the privacy framework when considering the use of randomization to ensure data privacy. Such a guarantee is alway...
Towards Characterizing Securely Computable Two-Party Randomized Functions
Secure computation randomized functions characterization
2017/7/24
A basic question of cryptographic complexity is to combinatorially characterize all randomized functions which have information-theoretic semi-honest secure 2-party computation protocols. The correspo...
Garbled Circuits as Randomized Encodings of Functions: a Primer
randomized encoding garbled circuits
2017/5/5
Yao's garbled circuit construction is a central cryptographic tool with numerous applications. In this tutorial, we study garbled circuits from a foundational point of view under the framework of rand...
Randomized lattice sieving for the closest vector problem (with preprocessing)
lattices sieving algorithms nearest neighbor searching
2016/12/9
In practice, the large memory footprint makes it problematic to run sieving directly on high-dimensional lattices, and perhaps the most promising application of such algorithms is as part of a hybrid ...
Randomized Mixed-Radix Scalar Multiplication
Elliptic curve arithmetic Side-channel attacks
2016/12/7
A covering system of congruences can be defined as a set of congruence relations of the form: {r1(modm1),r2(modm2),…,rt(modmt)}{r1(modm1),r2(modm2),…,rt(modmt)} for m1,…,mt∈Nm1,…,mt∈N satisfying the p...
Conventionally, key-scheduling algorithm (KSA) of a cryptographic scheme runs for predefined number of steps. We suggest a different approach by utilization of randomized stopping rules to generate pe...
On the Relationship between Statistical Zero-Knowledge and Statistical Randomized Encodings
Cryptography Complexity Statsitical Zero Knowldge
2016/5/30
\emph{Statistical Zero-knowledge proofs} (Goldwasser, Micali and Rackoff, SICOMP 1989) allow a computationally-unbounded server to convince a computationally-limited client that an input x is in a lan...
Functional Encryption: Deterministic to Randomized Functions from Simple Assumptions
functional encryption randomized functionalities malicious security
2016/5/24
Functional encryption (FE) enables fine-grained control of encrypted data by allowing users to compute only those functions for which they have a key. Until recently, FE schemes could only support det...
A Full Characterization of Completeness for Two-party Randomized Function Evaluation
Foundations Secure 2-party Randomized Function Evaluation Completeness Characterization
2016/1/26
We settle a long standing open problem which has pursued a full characterization of completeness of
(potentially randomized) finite functions for 2-party computation that is secure against active adv...
Randomized and Efficient Authentication in Mobile Environments
applications authentication
2016/1/26
In a mobile environment, a number of users act as a network nodes and communicate with one
another to acquire location based information and services. This emerging paradigm has opened up
new busine...
Handycipher: a Low-tech, Randomized, Symmetric-key Cryptosystem
stream ciphers secret-key cryptography randomized homophonic substitution
2016/1/23
Handycipher is a low-tech, randomized, symmetric-key, stream cipher, simple enough to permit pen-and-paper encrypting and decrypting of messages, while providing a significantly high level of security...