Sciweavers

235 search results - page 36 / 47
» Quantum certificate complexity
Sort
View
COCO
2009
Springer
126views Algorithms» more  COCO 2009»
14 years 3 months ago
New Results in the Simultaneous Message Passing Model via Information Theoretic Techniques
—Consider the following Simultaneous Message Passing (SMP) model for computing a relation f ⊆ X ×Y ×Z. In this model Alice, on input x ∈ X and Bob, on input y ∈ Y, send o...
Rahul Jain, Hartmut Klauck
STOC
2005
ACM
113views Algorithms» more  STOC 2005»
14 years 9 months ago
Efficient testing of groups
We construct an efficient probabilistic algorithm that, given a finite set with a binary operation, tests if it is an abelian group. The distance used is an analogue of the edit d...
Katalin Friedl, Gábor Ivanyos, Miklos Santh...
CSE
2009
IEEE
14 years 25 days ago
Reliable Identities Using Off-the-Shelf Hardware Security in MANETs
Application scenarios for mobile ad-hoc networks (MANETs) impose a variety of non-standard security requirements. furthermore, in many scenarios owner and user of devices do not a...
Nicolai Kuntze, Andreas Fuchs, Carsten Rudolph
DCG
2010
53views more  DCG 2010»
13 years 9 months ago
A Revision of the Proof of the Kepler Conjecture
Abstract. The Kepler conjecture asserts that no packing of congruent balls in three-dimensional Euclidean space has density greater than that of the face-centered cubic packing. Th...
Thomas C. Hales, John Harrison, Sean McLaughlin, T...
ISCI
2008
160views more  ISCI 2008»
13 years 9 months ago
Certificateless undeniable signature scheme
In this paper, we present the first certificateless undeniable signature scheme. The scheme does not suffer from the key escrow problem, which is inherent in identity based crypto...
Shanshan Duan