搜索结果: 1-15 共查到“军事学 Lossy”相关记录21条 . 查询时间(0.093 秒)
Current blockchains are restricted by the low throughput. Aimed at this problem, we propose Txilm, a protocol that compresses the size of transaction presentation in each block and thus saves the band...
Lossy Trapdoor Permutations with Improved Lossiness
lossy trapdoor functions,RSA phi-hiding
2018/12/6
Lossy trapdoor functions (Peikert and Waters, STOC 2008 and SIAM J. Computing 2011) imply, via black-box transformations, a number of interesting cryptographic primitives, including chosen-ciphertext ...
Regularly Lossy Functions and Their Applications
public-key cryptography leakage-resilient cryptography
2018/1/11
In STOC 2008, Peikert and Waters introduced a powerful primitive called lossy trapdoor functions (LTFs). In a nutshell, LTFs are functions that behave in one of two modes. In the normal mode, function...
All-But-Many Lossy Trapdoor Functions and Selective Opening Chosen-Ciphertext Security from LWE
LWE lossy trapdoor functions chosen-ciphertext security
2017/9/14
Selective opening (SO) security refers to adversaries that receive a number of ciphertexts and, after having corrupted a subset of the senders (thus obtaining the plaintexts and the senders' random co...
All-But-Many Lossy Trapdoor Functions from Lattices and Applications
all-but-many lossy trapdoor functions lattice selective opening attacks
2017/6/8
Our second result is a public-key system tightly secure against ``selective opening'' attacks, where an attacker gets many challenges and can ask to see the random bits of any of them. Following the s...
Multi-Key Authenticated Encryption with Corruptions: Reductions are Lossy
authenticated encryption black-box reductions multi-key security
2017/6/2
We study the security of symmetric encryption schemes in settings with multiple users and realistic adversaries who can adaptively corrupt encryption keys. To avoid confinement to any particular defin...
Efficient Oblivious Transfer from Lossy Threshold Homomorphic Encryption
Oblivious transfer Active adversary One-sided adaptive adversary
2017/3/13
In this article, a new oblivious transfer (OT) protocol, secure in the presence of erasure-free one-sided active adaptive adversaries is presented. The new bit OT protocol achieves better communicatio...
Adversary-dependent Lossy Trapdoor Function from Hardness of Factoring Semi-smooth RSA Subgroup Moduli
factoring assumption semi-smooth RSA subgroup modulus lossy trapdoor function
2016/6/6
Lossy trapdoor functions (LTDFs), proposed by Peikert and Waters (STOC'08), are known to have a number of applications in cryptography. They have been constructed based on various assumptions, which i...
Spectral characterization of iterating lossy mappings
iterative lossy mappings correlation matrices non-uniformity
2016/2/23
In this paper we study what happens to sets when we iteratively apply lossy (round) mappings
to them. We describe the information loss as imbalances of parities of intermediate distributions
and sho...
On the Regularity of Lossy RSA: Improved Bounds and Applications to Padding-Based Encryption
PKCS Phi-Hiding Regularity
2016/1/5
We provide new bounds on how close to regular the map x |--> x^e is on arithmetic progressions in Z_N, assuming e | Phi(N) and N is composite. We use these bounds to analyze the security of natural cr...
Building Lossy Trapdoor Functions from Lossy Encryption
public-key cryptography derandomization injective trapdoor functions oblivious transfer
2016/1/4
Injective one-way trapdoor functions are one of the most fundamental cryptographic primitives. In
this work we show how to derandomize lossy encryption (with long messages) to obtain lossy trapdoor
...
Tightly-Secure Signatures From Lossy Identification Schemes
Signature schemes tight reductions Fiat-Shamir
2014/3/5
In this paper we present three digital signature schemes with tight security reductions. Our first signature scheme is a particularly efficient version of the short exponent discrete log based scheme ...
Leakage-Resilient Chosen-Ciphertext Secure Public-Key Encryption from Hash Proof System and One-Time Lossy Filter
Public-key encryption leakage-resilience
2014/3/7
We present a new generic construction of a public-key encryption (PKE) scheme secure against leakage-resilient chosen-ciphertext attacks (LR-CCA), from any Hash Proof System (HPS) and any one-time los...
Motivated by the goal of controlling the amount of work required to access a shared resource or to solve a cryptographic puzzle, we introduce and study the related notions of {\em lossy chains} and {\...
All-But-Many Lossy Trapdoor Functions
public-key cryptography / lossy trapdoor functions public-key encryption selective opening attacks
2012/3/28
We put forward a generalization of lossy trapdoor functions (LTFs). Namely, all-but-many lossy trapdoor functions (ABM-LTFs) are LTFs that are parametrized with tags. Each tag can either be injective ...