搜索结果: 1-7 共查到“密码学 Trapdoor Permutations”相关记录7条 . 查询时间(0.062 秒)
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 ...
Enhancements Are Blackbox Non-Trivial: Impossibility of Enhanced Trapdoor Permutations from Standard Trapdoor Permutations
Black-box separations Enhanced Trapdoor Permutations Trapdoor Permutations
2018/11/9
Trapdoor permutations (TDP) are a fundamental primitive in cryptography. Over the years, several variants of this notion have emerged as a result of various applications. However, it is not clear whet...
Round-Optimal Secure Two-Party Computation from Trapdoor Permutations
Two-Party Computation Oblivious Transfer Simultaneous Model Exchange Channel
2017/9/25
In this work we continue the study on the round complexity of secure two-party computation with black-box simulation. Katz and Ostrovsky in CRYPTO 2004 showed a 5 (optimal) round construction assuming...
Certifying Trapdoor Permutations, Revisited
Non-Interactive Zero-Knowledge Trapdoor Permutations Indistinguishability Obfuscation
2017/6/28
The modeling of trapdoor permutations has evolved over the years. Indeed, finding an appropriate abstraction that bridges between the existing candidate constructions and the needs of applications has...
Sequential Aggregate Signatures with Lazy Verification from Trapdoor Permutations
public-key cryptography / aggregate signatures RSA BGPsec
2012/3/28
Sequential aggregate signature schemes allow n signers, in order, to sign a message each, at a lower total cost than the cost of n individual signatures. We present a sequential aggregate signature sc...
Uniqueness is a Different Story: Impossibility of Verifiable Random Functions from Trapdoor Permutations
verifiable random functions trapdoor permutations black-box separations
2010/12/22
Verifiable random functions (VRFs), firstly proposed by Micali, Rabin, and Vadhan (FOCS 99), are pseudorandom functions with the additional property that the owner of the seed $\vsk$ can issue publicl...
Sequential Aggregate Signatures from Trapdoor Permutations
Sequential Aggregate Signatures Trapdoor Permutations
2009/4/9
An aggregate signature scheme (recently proposed by Boneh, Gentry, Lynn, and Shacham)
is a method for combining n signatures from n different signers on n different messages into
one signature of un...