Sciweavers

4702 search results - page 4 / 941
» How to Copyright a Function
Sort
View
100
Voted
ISW
2004
Springer
15 years 6 months ago
How to Break and Repair a Universally Composable Signature Functionality
Abstract. Canetti and Rabin recently proposed a universally composable ideal functionality FSIG for digital signatures. We show that this functionality cannot be securely realized ...
Michael Backes, Dennis Hofheinz
105
Voted
AFRICACRYPT
2008
Springer
15 years 2 months ago
How (Not) to Efficiently Dither Blockcipher-Based Hash Functions?
Abstract. In the context of iterated hash functions, "dithering" designates the technique of adding an iteration-dependent input to the compression function in order to d...
Jean-Philippe Aumasson, Raphael C.-W. Phan
COCO
2004
Springer
118views Algorithms» more  COCO 2004»
15 years 6 months ago
Graph Properties and Circular Functions: How Low Can Quantum Query Complexity Go?
In decision tree models, considerable attention has been paid on the effect of symmetry on computational complexity. That is, for a permutation group Γ, how low can the complexit...
Xiaoming Sun, Andrew Chi-Chih Yao, Shengyu Zhang
100
Voted
JSYML
2010
114views more  JSYML 2010»
14 years 11 months ago
The Ackermann functions are not optimal, but by how much?
By taking a closer look at the construction of an Ackermann function we see that between any primitive recursive degree and its Ackermann modification there is a dense chain of p...
Harold Simmons
EUROGP
1999
Springer
105views Optimization» more  EUROGP 1999»
15 years 4 months ago
How to Invent Functions
The paper presents the abstraction transformation which is a fundaethod for creating functions in ADATE. The use of abstraction turns out to be similar to evolution by gene duplic...
Roland Olsson