Sciweavers

49 search results - page 7 / 10
» A q-enumeration of alternating permutations
Sort
View
COCO
2007
Springer
88views Algorithms» more  COCO 2007»
14 years 1 months ago
A New Interactive Hashing Theorem
Interactive hashing, introduced by Naor, Ostrovsky, Venkatesan and Yung (CRYPTO ’92), plays an important role in many cryptographic protocols. In particular, it is a major compo...
Iftach Haitner, Omer Reingold
SUTC
2010
IEEE
13 years 6 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...
ALENEX
2009
172views Algorithms» more  ALENEX 2009»
13 years 5 months ago
Rank Aggregation: Together We're Strong
We consider the problem of finding a ranking of a set of elements that is "closest to" a given set of input rankings of the elements; more precisely, we want to find a p...
Frans Schalekamp, Anke van Zuylen
SIAMCOMP
2011
13 years 2 months ago
Black-Box Constructions of Protocols for Secure Computation
In this paper, we study the question of whether or not it is possible to construct protocols for general secure computation in the setting of malicious adversaries and no honest m...
Iftach Haitner, Yuval Ishai, Eyal Kushilevitz, Yeh...
ISCAS
2008
IEEE
100views Hardware» more  ISCAS 2008»
14 years 2 months ago
On the security of a class of image encryption schemes
— Recently four chaos-based image encryption schemes were proposed. Essentially, the four schemes can be classified into one class, which is composed of two basic parts: permuta...
Chengqing Li, Guanrong Chen