Sciweavers

5326 search results - page 327 / 1066
» On what we can ensure
Sort
View
174
Voted
FSTTCS
2003
Springer
15 years 12 months ago
Moderately Hard Functions: From Complexity to Spam Fighting
A key idea in cryptography is using hard functions in order to obtain secure schemes. The theory of hard functions (e.g. one-way functions) has been a great success story, and the ...
Moni Naor
GECCO
2003
Springer
15 years 12 months ago
The Structure of Evolutionary Exploration: On Crossover, Buildings Blocks, and Estimation-Of-Distribution Algorithms
Correlations between alleles after selection are an important source of information. Such correlations should be exploited for further search and thereby constitute the building bl...
Marc Toussaint
MPC
2010
Springer
159views Mathematics» more  MPC 2010»
15 years 11 months ago
Subtyping, Declaratively
Abstract. It is natural to present subtyping for recursive types coinductively. However, Gapeyev, Levin and Pierce have noted that there is a problem with coinductive definitions ...
Nils Anders Danielsson, Thorsten Altenkirch
ISW
2001
Springer
15 years 11 months ago
Suitability of a Classical Analysis Method for E-commerce Protocols
We present the adaptation of our model for the validation of key distribution and authentication protocols to address specific needs of protocols for electronic commerce. The two ...
Sigrid Gürgens, Javier Lopez
ECWEB
2000
Springer
77views ECommerce» more  ECWEB 2000»
15 years 11 months ago
Selling Bits: A Matter of Creating Consumer Value
Abstract. Digital goods such as music are vulnerable to illegal use over the internet. Technology-driven IT solutions to protection are useful but limited. Instead, we suggest that...
Jaap Gordijn, Hans Akkermans, Hans van Vliet, Edwi...