Sciweavers

68 search results - page 4 / 14
» Cross-intersecting families of permutations
Sort
View
COMBINATORICS
2007
49views more  COMBINATORICS 2007»
13 years 7 months ago
Wreath Products of Permutation Classes
A permutation class which is closed under pattern involvement may be described in terms of its basis. The wreath product construction X Y of two permutation classes X and Y is als...
Robert Brignall
EUROCRYPT
2000
Springer
13 years 11 months ago
Perfectly Concealing Quantum Bit Commitment from any Quantum One-Way Permutation
We show that although unconditionally secure quantum bit commitment is impossible, it can be based upon any family of quantum one-way permutations. The resulting scheme is uncondit...
Paul Dumais, Dominic Mayers, Louis Salvail
TCC
2009
Springer
153views Cryptology» more  TCC 2009»
14 years 8 months ago
On the (Im)Possibility of Key Dependent Encryption
We study the possibility of constructing encryption schemes secure under messages that are chosen depending on the key k of the encryption scheme itself. We give the following sep...
Iftach Haitner, Thomas Holenstein
CRYPTO
2005
Springer
163views Cryptology» more  CRYPTO 2005»
14 years 1 months ago
On the Generic Insecurity of the Full Domain Hash
The Full-Domain Hash (FDH) signature scheme [3] forms one the most basic usages of random oracles. It works with a family F of trapdoor permutations (TDP), where the signature of m...
Yevgeniy Dodis, Roberto Oliveira, Krzysztof Pietrz...
EUROCRYPT
2004
Springer
14 years 1 months ago
Sequential Aggregate Signatures from Trapdoor Permutations
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 int...
Anna Lysyanskaya, Silvio Micali, Leonid Reyzin, Ho...