搜索结果: 1-15 共查到“军事学 Applications”相关记录384条 . 查询时间(0.252 秒)
At CRYPTO 2017, Rosca et al. introduce a new variant of the Learning With Errors (LWE) problem, called the Middle-Product LWE (MP-LWE). The hardness of this new assumption is based on the hardness of ...
RAMPARTS: A Programmer-Friendly System for Building Homomorphic Encryption Applications
Homomorphic encryption Automatic arithmetic circuit generation Lattice-based cryptography
2019/9/3
Homomorphic Encryption (HE) is an emerging technnology that enables computing on data while the data is encrypted. A major challenge with homomorphic encryption is that it takes extensive expert knowl...
Efficient Range-Trapdoor Functions and Applications: Rate-1 OT and More
Trapdoor functions range trapdoor hash power DDH
2019/9/3
Substantial work on trapdoor functions (TDFs) has led to many powerful notions and applications. However, despite tremendous work and progress, all known constructions have prohibitively large public ...
Puncturable Signatures and Applications in Proof-of-Stake Blockchain Protocol
Puncturable Signatures PoS Blockchain
2019/8/30
Proof-of-stake (PoS) blockchain protocols are emerging as one of the most promising alternative to the energy-consuming proof-of-work protocols. However, one particularly critical threat in the PoS se...
Graph Similarity and Its Applications to Hardware Security
Graph Similarity Hardware Reverse Engineering Hardware Trojan
2019/8/30
Hardware reverse engineering is a powerful and universal tool for both security engineers and adversaries. From a defensive perspective, it allows for detection of intellectual property infringements ...
Structure-Preserving and Re-randomizable RCCA-secure Public Key Encryption and its Applications
public-key cryptography Rand-RCCA PKE
2019/8/22
Re-randomizable RCCA-secure public key encryption (Rand-RCCA PKE) schemes reconcile the property of re-randomizability of the ciphertexts with the need of security against chosen-ciphertexts attacks.
Traceable and linkable ring signatures, traceable range proofs and applications on regulatable privacy-preserving blockchains
regulatable blockchain privacy preserving decentralization
2019/8/19
Privacy protection has been extensively studied in the current blockchain research field. As representations, Monero and Zerocash have realized completely anonymous and amount-hiding transactions. How...
Simulation-Sound Proofs for LWE and Applications to KDM-CCA2 Security
LWE standard model Naor-Yung
2019/8/8
The Naor-Yung paradigm is a well-known technique that constructs IND-CCA2-secure encryption schemes by means of non-interactive zero-knowledge proofs satisfying a notion of simulation-soundness. Until...
Invariant subspaces (Crypto'11) and subspace trails (FSE'17) are two related recent cryptanalytic approaches that led to new results on, e. g. PRINTCipher and AES. We extend the invariant subspace app...
Asymptotically-Good Arithmetic Secret Sharing over Z/(p^\ell Z) with Strong Multiplication and Its Applications to Efficient MPC
multiparty computation amortization information-theoretical security
2019/7/18
This paper deals with (1) asymptotics of ``strongly-multiplicative'' arithmetic secret sharing over an arbitrary fixed ring Rℓ:=Z/pℓZ (p>0 prime, ℓ>0 an integer) and supporting an un...
Securely Sampling Biased Coins with Applications to Differential Privacy
distributed differential privacy secure computation
2019/7/17
We design an efficient method for sampling a large batch of dd independent coins with a given bias p∈[0,1]p∈[0,1]. The folklore secure computation method for doing so requires O(λ+logd)O(λ+logd...
Estimating Gaps in Martingales and Applications to Coin-Tossing: Constructions and Hardness
information theory foundations distributed cryptography
2019/7/8
Consider the representative task of designing a distributed coin-tossing protocol for nn processors such that the probability of heads is X0∈[0,1]X0∈[0,1], and an adversary can reset one processor to ...
Efficient Lattice-Based Zero-Knowledge Arguments with Standard Soundness: Construction and Applications
Lattice Zero-Knowledge Argument
2019/6/26
We provide new zero-knowledge argument of knowledge systems that work directly for a wide class of language, namely, ones involving the satisfiability of matrix-vector relations and integer relations ...
Scrutinizing the Tower Field Implementation of the $\mathbb{F}_{2^8}$ Inverter -- with Applications to AES, Camellia, and SM4
Tower field Inverter S-box
2019/6/24
The tower field implementation of the F28F28 inverter is not only the key technique for compact implementations of the S-boxes of several internationally standardized block ciphers such as AES, Camell...
Homomorphic encryption (HE) is often viewed as impractical, both in communication and computation. Here we provide an additively homomorphic encryption scheme based on (ring) LWE with nearly optimal r...