Sciweavers

128 search results - page 4 / 26
» Weak Verifiable Random Functions
Sort
View
GECCO
2006
Springer
152views Optimization» more  GECCO 2006»
14 years 6 days ago
Strong recombination, weak selection, and mutation
We show that there are unimodal fitness functions and genetic algorithm (GA) parameter settings where the GA, when initialized with a random population, will not move close to the...
Alden H. Wright, J. Neal Richter
PROVSEC
2010
Springer
13 years 6 months ago
Identity Based Public Verifiable Signcryption Scheme
Abstract. Signcryption as a single cryptographic primitive offers both confidentiality and authentication simultaneously. Generally in signcryption schemes, the message is hidden a...
S. Sharmila Deva Selvi, S. Sree Vivek, C. Pandu Ra...
APAL
2004
105views more  APAL 2004»
13 years 8 months ago
Dual weak pigeonhole principle, Boolean complexity, and derandomization
We study the extension (introduced as BT in [5]) of the theory S1 2 by instances of the dual (onto) weak pigeonhole principle for p-time functions, dWPHP(PV )x x2 . We propose a n...
Emil Jerábek
CANS
2005
Springer
120views Cryptology» more  CANS 2005»
14 years 2 months ago
The Second-Preimage Attack on MD4
In Eurocrypt’05, Wang et al. presented new techniques to find collisions of Hash function MD4. The techniques are not only efficient to search for collisions, but also applicabl...
Hongbo Yu, Gaoli Wang, Guoyan Zhang, Xiaoyun Wang
ECEASST
2010
13 years 3 months ago
Verified Visualisation of Textual Modelling Languages
Abstract. Many modelling languages have both a textual and a graphical form. The relationship between these two forms ought to be clear and concrete, but is instead commonly unders...
Fintan Fairmichael, Joseph Kiniry