搜索结果: 1-15 共查到“军事学 Batch”相关记录26条 . 查询时间(0.046 秒)
Accelerating V2X Cryptography through Batch Operations
Implicit certificates ECQV Batch ECDSA
2019/8/6
The increasing communication capabilities of vehicles are paving the way for promising road safety and traffic management applications. But the rise of connected vehicles also potentially introduces m...
Batch Binary Weierstrass
public-key cryptography elliptic curve cryptosystem implementation
2019/7/18
Bitslicing is a programming technique that offers several attractive features, such as timing attack resistance, high amortized performance in batch computation, and architecture independence. On the ...
The FHE (fully homomorphic encryption) schemes [7, 13] based on the modified AGCD problem (noise-free AGCD problem) are vulnerable to quantum attacks, because its security relies partly on the hardnes...
Monotone Batch NP-Delegation with Applications to Access Control
delegation witness indistinguishability access control
2018/5/2
Consider an access policy for some resource which only allows access to users of the system who own a certain set of attributes. Specifically, we consider the case where such an access structure is de...
3PC ORAM with Low Latency, Low Bandwidth, and Fast Batch Retrieval
secure computation multi-party computation (MPC) oblivious RAM (ORAM)
2018/4/17
Multi-Party Computation of Oblivious RAM (MPC ORAM) implements secret-shared random access memory in a way that protects access pattern privacy against a threshold of corruptions. MPC ORAM enables sec...
Efficient Batch Zero-Knowledge Arguments for Low Degree Polynomials
Sigma-protocol zero-knowledge argument batch-verification
2018/1/11
The work of Bootle et al. (EUROCRYPT 2016) constructs an extremely efficient zero-knowledge argument for arithmetic circuit satisfiability in the discrete logarithm setting. However, the argument does...
New Techniques for Structural Batch Verification in Bilinear Groups with Applications to Groth-Sahai Proofs
Batch verification bilinear maps Groth-Sahai proofs
2017/8/29
Bilinear groups form the algebraic setting for a multitude of important cryptographic protocols including anonymous credentials, e-cash, e-voting, e-coupon, and loyalty systems. It is typical of such ...
Non-Interactive Secure 2PC in the Offline/Online and Batch Settings
secure two-party computation garbled circuits batched cut-and-choose
2017/2/20
In cut-and-choose protocols for two-party secure computation (2PC) the main overhead is the number of garbled circuits that must be sent. Recent work (Lindell, Riva; Huang et al., Crypto 2014) has sho...
Polynomial Batch Codes for Efficient IT-PIR
Private information retrieval batch codes batch queries
2016/6/8
Private information retrieval (PIR) is a way for clients to query a remote database without the database holder learning the clients' query terms or the responses they generate. Compelling application...
Non-Interactive RAM and Batch NP Delegation from any PIR
Delegation No-Signaling Adaptive Soundness
2016/5/17
We present an adaptive and non-interactive protocol for verifying arbitrary efficient computations in fixed polynomial time. Our protocol is computationally sound and can be based on any computational...
Cut-and-Choose Based Two-Party Computation in the Online/Offline and Batch Settings
secure computation garbled circuits malicious adversaries
2016/1/7
Protocols for secure two-party computation enable a pair of mistrusting parties to compute a joint function of their private inputs without revealing anything but the output. One of the fundamental te...
(Batch) Fully Homomorphic Encryption over Integers for Non-Binary Message Spaces
Fully homomorphic encryption non-binary message
2016/1/6
In this paper, we construct a fully homomorphic encryption (FHE) scheme over integers with the message space ZQ for any prime Q. Even for the binary case Q=2, our decryption circuit has a smaller degr...
This paper shows, assuming standard heuristics regarding the number-field sieve, that a "batch NFS" circuit of area L^{1.181...+o(1)} factors L^{0.5+o(1)} separate B-bit RSA keys in time L^{1.022...+o...
A fast integer-based batch full-homomorphic encryption scheme over finite field
full-homomorphic integer-based
2014/3/5
In view of the problems that the plaintext space is too small in the existing schemes. In this paper, a new improved scheme is presented by improving the DGHV scheme. The plaintext space of the improv...
Machine-Generated Algorithms, Proofs and Software for the Batch Verification of Digital Signature Schemes
digital signatures pairing-based cryptography batch verification automation crypographic compiler
2013/4/18
As devices everywhere increasingly communicate with each other, many security applications will require low-bandwidth signatures that can be processed quickly. Pairing-based signatures can be very sho...