1028 search results - page 116 / 206 » Character sets of strings |
CRYPTO
2001
Springer
14 years 1 months ago
2001
Springer
d Abstract) Ran Canetti and Marc Fischlin Abstract. We propose a new security measure for commitment protocols, called Universally Composable (UC) Commitment. The measure guarantee...
GECCO
2006
Springer
14 years 22 days ago
2006
Springer
We propose a crossover method to combine complexly overlapping building blocks (BBs). Although there have been several techniques to identify linkage sets of loci o form a BB [4, ...
CRYPTO
2010
Springer
13 years 10 months ago
2010
Springer
We prove beyond-birthday-bound security for most of the well-known types of generalized Feistel networks: (1) unbalanced Feistel networks, where the n-bit to m-bit round functions ...
ECEASST
2008
13 years 9 months ago
2008
: Graph parsing is known to be computationally expensive. For this reason the construction of special-purpose parsers may be beneficial for particular graph languages. In the domai...
CC
2006
Springer
13 years 9 months ago
2006
Springer
Variants of Kannan's Theorem are given where the circuits of the original theorem are replaced by arbitrary recursively presentable classes of languages that use advice string...