Sciweavers

Share
30 search results - page 1 / 6
» Notions and relations for RKA-secure permutation and functio...
Sort
View
DCC
2011
IEEE
8 years 3 months ago
Notions and relations for RKA-secure permutation and function families
Jongsung Kim, Jaechul Sung, Ermaliza Razali, Rapha...
CCS
2009
ACM
8 years 9 months ago
RFID privacy: relation between two notions, minimal condition, and efficient construction
Privacy of RFID systems is receiving increasing attention in the RFID community. Basically, there are two kinds of RFID privacy notions: one based on the indistinguishability of t...
Changshe Ma, Yingjiu Li, Robert H. Deng, Tieyan Li
PKC
2004
Springer
195views Cryptology» more  PKC 2004»
9 years 5 months ago
An RSA Family of Trap-Door Permutations with a Common Domain and Its Applications
Abstract. Bellare, Boldyreva, Desai, and Pointcheval [1] recently proposed a new security requirement of the encryption schemes called “keyprivacy.” It asks that the encryption...
Ryotaro Hayashi, Tatsuaki Okamoto, Keisuke Tanaka
WABI
2001
Springer
138views Bioinformatics» more  WABI 2001»
9 years 4 months ago
Algorithms for Finding Gene Clusters
Abstract. Comparing gene orders in completely sequenced genomes is a standard approach to locate clusters of functionally associated genes. Often, gene orders are modeled as permut...
Steffen Heber, Jens Stoye
DIMACS
2001
9 years 1 months ago
On the Number of Connected Components of the Relative Closure of a Semi-Pfaffian Family
The notion of relative closure (X, Y )0 of a semi-Pfaffian couple (X, Y ) was introduced by Gabrielov to give a description of the o-minimal structure generated by Pfaffian functio...
Andrei Gabrielov, Thierry Zell
books