Sciweavers

1696 search results - page 46 / 340
» Permuted function matching
Sort
View
IACR
2011
162views more  IACR 2011»
13 years 9 months ago
The Parazoa Family: Generalizing the Sponge Hash Functions
Abstract. Sponge functions were introduced by Bertoni et al. as an alternative to the classical MerkleDamg˚ard design. Many hash function submissions to the SHA-3 competition laun...
Elena Andreeva, Bart Mennink, Bart Preneel
ASIACRYPT
2009
Springer
15 years 4 months ago
Foundations of Non-malleable Hash and One-Way Functions
Non-malleability is an interesting and useful property which ensures that a cryptographic protocol preserves the independence of the underlying values: given for example an encryp...
Alexandra Boldyreva, David Cash, Marc Fischlin, Bo...
CVPR
2008
IEEE
16 years 1 days ago
ANSIG - An analytic signature for permutation-invariant two-dimensional shape representation
Many applications require a computer representation of 2D shape, usually described by a set of 2D points. The challenge of this representation is that it must not only capture the...
José J. Rodrigues, Pedro M. Q. Aguiar, Jo&a...
STOC
2006
ACM
120views Algorithms» more  STOC 2006»
15 years 10 months ago
Black-box constructions for secure computation
d abstract) Yuval Ishai Eyal Kushilevitz Yehuda Lindell Erez Petrank It is well known that the secure computation of non-trivial functionalities in the setting of no honest majori...
Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Ere...
SUTC
2010
IEEE
14 years 8 months ago
Reordering for Better Compressibility: Efficient Spatial Sampling in Wireless Sensor Networks
—Compressed Sensing (CS) is a novel sampling paradigm that tries to take data-compression concepts down to the sampling layer of a sensory system. It states that discrete compres...
Mohammadreza Mahmudimanesh, Abdelmajid Khelil, Nee...