搜索结果: 1-15 共查到“军事学 Large p”相关记录64条 . 查询时间(0.14 秒)
Faster Bootstrapping of FHE over the integers with large prime message space
Fully homomorphic encryption Bootstrapping Restricted depth-3 circuit
2019/5/27
Ternary Syndrome Decoding with Large Weight
public-key cryptography code-based cryptography Information set decoding
2019/3/21
The Syndrome Decoding problem is at the core of many code-based cryptosystems. In this paper, we study ternary Syndrome Decoding in large weight. This problem has been introduced in the Wave signature...
Attacks Only Get Better: How to Break FF3 on Large Domains
Format-preserving encryption attacks
2019/3/2
We improve the attack of Durak and Vaudenay (CRYPTO'17) on NIST Format-Preserving Encryption standard FF3, reducing the running time from O(N5)O(N5) to O(N17/6)O(N17/6) for domain ZN×ZNZN×ZN. Concrete...
Repeatable Oblivious Shuffling of Large Outsourced Data Blocks
oblivious shuffling data outsourcing cloud computing
2019/1/26
As data outsourcing becomes popular, oblivious algorithms have raised extensive attentions since their control flow and data access pattern appear to be independent of the input data they compute on a...
Large Universe Subset Predicate Encryption Based on Static Assumption (without Random Oracle)
Predicate Encryption Adaptive Security Standard Model
2018/12/11
In a recent work, Katz et al. (CANS'17) generalized the notion of Broadcast Encryption to define Subset Predicate Encryption (SPE) that emulates \emph{subset containment} predicate in the encrypted do...
Concretely Efficient Large-Scale MPC with Active Security (or, TinyKeys for TinyOT)
MPC large scale concrete efficiency
2018/11/16
In this work we develop a new theory for concretely efficient, large-scale MPC with active security. Current practical techniques are mostly in the strong setting of all-but-one corruptions, which lea...
An End-to-End System for Large Scale P2P MPC-as-a-Service and Low-Bandwidth MPC for Weak Participants
cryptographic protocols secure multiparty computation
2018/8/21
Protocols for secure multiparty computation enable a set of parties to compute a joint function of their inputs, while preserving \emph{privacy}, \emph{correctness} and more. In theory, secure computa...
Efficient Logistic Regression on Large Encrypted Data
implementation machine learning homomorphic encryption
2018/7/10
Machine learning on encrypted data is a cryptographic method for analyzing private and/or sensitive data while keeping privacy. In the training phase, it takes as input an encrypted training data and ...
Fast Large-Scale Honest-Majority MPC for Malicious Adversaries
honest majority arithmetic circuits information-theoretic security
2018/6/6
Protocols for secure multiparty computation enable a set of parties to compute a function of their inputs without revealing anything but the output. The security properties of the protocol must be pre...
In this position paper, we initiate a systematic treatment of reaching consensus in a permissionless network. We prove several simple but hopefully insightful lower bounds that demonstrate exactly why...
Hardware-Supported ORAM in Effect: Practical Oblivious Search and Update on Very Large Dataset
Secure Enclaves Intel SGX Oblivious Data Structures
2018/3/8
Ability to query and update over encrypted data is an essential feature to enable breach-resilient cyber-infrastructures. Statistical attacks on searchable encryption (SE) have demonstrated the import...
Scalable Key Rank Estimation (and Key Enumeration) Algorithm for Large Keys
Side-channel analysis Evaluation Security assessment
2018/3/6
Evaluation of security margins after a side-channel attack is an important step of side-channel resistance evaluation. The security margin indicates the brute force effort needed to recover the key gi...
Defending Against Key Exfiltration: Efficiency Improvements for Big-Key Cryptography via Large-Alphabet Subkey Prediction
Random oracle model bounded retrieval model big-key cryptography
2018/3/5
Towards advancing the use of BIG keys as a practical defense against key exfiltration, this paper provides efficiency improvements for cryptographic schemes in the bounded retrieval model (BRM). We id...
Secure Multi-Party Computation in Large Networks
Secure multi-party computation Secret sharing Information-theoretic security
2017/10/16
We describe scalable protocols for solving the secure multi-party computation (MPC) problem among a significant number of parties. We consider both the synchronous and the asynchronous communication m...
Large FHE gates from Tensored Homomorphic Accumulator
Fully Homomorphic Encryption Large Gates Threshold Gates
2017/10/12
The main bottleneck of all known Fully Homomorphic Encryption schemes lies in the bootstrapping procedure invented by Gentry (STOC'09). The cost of this procedure can be mitigated either using Homomor...