搜索结果: 1-15 共查到“军事学 bounded”相关记录61条 . 查询时间(0.078 秒)
Lattice Gaussian Sampling by Markov Chain Monte Carlo: Bounded Distance Decoding and Trapdoor Sampling
lattice Gaussian sampling Markov chain Monte Carlo bounded distance decoding
2019/6/5
Sampling from the lattice Gaussian distribution plays an important role in various research fields. In this paper, the Markov chain Monte Carlo (MCMC)-based sampling technique is advanced in several f...
Continuous Space-Bounded Non-Malleable Codes from Stronger Proofs-of-Space
Non-Malleable Codes Proofs of Space Tamper-resilience
2019/5/24
Non-malleable codes are encoding schemes that provide protections against various classes of tampering attacks. Recently Faust et al. (CRYPTO 2017) initiated the study of space- bounded non-malleable ...
Simple Schemes in the Bounded Storage Model
Bounded Storage Model Commitment Oblivious Transfer
2019/5/21
The bounded storage model promises unconditional security proofs against computationally unbounded adversaries, so long as the adversary’s space is bounded. In this work, we develop simple new constru...
Optimal Bounded-Collusion Secure Functional Encryption
Bounded-Key Functional Encryption Correlated Garbling
2019/3/22
We construct private-key and public-key functional encryption schemes secure against adversaries that corrupt an a-priori bounded number of users and obtain their functional keys, from minimal assumpt...
Leakage-resilient Identity-based Encryption in Bounded Retrieval Model with Nearly Optimal Leakage-Ratio
Leakage-resilience Bounded retrieval model Identity-based Encryption
2019/1/26
We propose new constructions of leakage-resilient public-key encryption (PKE) and identity-based encryption (IBE) schemes in the bounded retrieval model (BRM). In the BRM, adversaries are allowed to o...
Pseudorandomness Against Mean and Variance Bounded Attackers
key derivation cryptography with weak keys pseudorandomness
2018/11/5
The recent progress in key derivation (Barak at al. CRYPTO'11, Dodis Yu TCC'2013) introduced the concept of constrained profiles for attackers advantage, recognizing that security bounds can be signif...
Non-Malleable Codes Against Bounded Polynomial Time Tampering
non-malleable code non-malleable commitment derandomization
2018/11/2
We construct efficient non-malleable codes (NMC) that are (computationally) secure against tampering by functions computable in any fixed polynomial time. Our construction is in the plain (no-CRS) mod...
We present a new method that produces bounded FHE schemes (see Definition 3), starting with encryption schemes that support one algebraic operation. We use this technique to construct examples of encr...
Polynomial Time Bounded Distance Decoding near Minkowski’s Bound in Discrete Logarithm Lattices
lattice techniques Bounded Distance Decoding Minkowski's bound
2018/2/9
We propose a concrete family of dense lattices of arbitrary dimension n in which the lattice Bounded Distance Decoding (BDD) problem can be solved in deterministic polynomial time. This construction i...
Non-Malleable Codes from Average-Case Hardness: AC0, Decision Trees, and Streaming Space-Bounded Tampering
non-malleable codes streaming
2017/11/3
We show a general framework for constructing non-malleable codes against tampering families with average-case hardness bounds. Our framework adapts ideas from the Naor-Yung double encryption paradigm ...
A practical, perfectly secure password scheme in the bounded retrieval model
secret-key cryptography bounded retrieval model
2017/9/25
In this paper, we present a practical password scheme due to Spilman, which is perfectly secure in the bounded retrieval model, assuming ideal hash functions. The construction is based on a hash-like ...
Black-Box Constructions of Signature Schemes in the Bounded Leakage Setting
identity-based signature certificateless signature black-box construction
2017/6/28
To simplify the certificate management procedures, Shamir introduced the concept of identity-based cryptography (IBC). However, the key escrow problem is inherent in IBC. To get rid of it, Al-Riyami a...
Non-Malleable Codes for Space-Bounded Tampering
Non-malleable Codes Proofs of Space Tamper-resilient Cryptography
2017/6/8
Non-malleable codes---introduced by Dziembowski, Pietrzak and Wichs at ICS 2010---are key-less coding schemes in which mauling attempts to an encoding of a given message, w.r.t.\ some class of tamperi...
Lattice-based Revocable Identity-based Encryption with Bounded Decryption Key Exposure Resistance
RIBE DKER
2017/4/17
A revocable identity-based encryption (RIBE) scheme, proposed by Boldyreva et al.\ (CCS'08), provides a revocation functionality for managing a number of users dynamically and efficiently. To capture ...
Locally Decodable and Updatable Non-Malleable Codes in the Bounded Retrieval Model
bounded retrieval model non-malleable codes locally decodable codes
2017/4/11
In a recent result, Dachman-Soled et al.(TCC '15) proposed a new notion called locally decodable and updatable non-malleable codes, which informally, provides the security guarantees of a non-malleabl...