搜索结果: 1-9 共查到“Lossy Trapdoor Functions”相关记录9条 . 查询时间(0.043 秒)
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...
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
...
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 ...
Identity-Based (Lossy) Trapdoor Functions and Applications
Identity-based encryption pairings lattices lossiness
2012/3/26
We provide the first constructions of identity-based (injective) trapdoor functions. Furthermore, they are lossy. Constructions are given both with pairings (DLIN) and lattices (LWE). Our lossy identi...
All-But-Many Lossy Trapdoor Functions
public-key cryptography / lossy trapdoor functions public-key encryption selective opening attacks
2011/6/8
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 ...
Chosen-Ciphertext Security from Slightly Lossy Trapdoor Functions
lossy trapdoor functions public-key encryption chosen-ciphertext attack
2009/11/18
Lossy Trapdoor Functions (LTDFs), introduced by Peikert and Waters (STOC 2008) have
been useful for building many cryptographic primitives. In particular, by using an LTDF that loses a
(1 ...
Efficient Lossy Trapdoor Functions based on the Composite Residuosity Assumption
Efficient Lossy Trapdoor Functions Composite Residuosity Assumption Peikert-Waters encryption scheme
2009/6/3
Lossy trapdoor functions (Peikert and Waters, STOC '08) are an intriguing and powerful
cryptographic primitive. Their main applications are simple and black-box constructions of
chosen-ciphertext se...
We propose a new general primitive called lossy trapdoor functions (lossy TDFs), and realize
it under a variety of different number theoretic assumptions, including hardness of the decisional Diffie-...