Sciweavers

132 search results - page 25 / 27
» New and improved constructions of non-malleable cryptographi...
Sort
View
ICALP
2005
Springer
14 years 16 days ago
Computational Bounds on Hierarchical Data Processing with Applications to Information Security
Motivated by the study of algorithmic problems in the domain of information security, in this paper, we study the complexity of a new class of computations over a collection of va...
Roberto Tamassia, Nikos Triandopoulos
EUROCRYPT
2000
Springer
13 years 10 months ago
Computing Inverses over a Shared Secret Modulus
We discuss the following problem: Given an integer shared secretly among n players and a prime number e, how can the players efficiently compute a sharing of e-1 mod . The most in...
Dario Catalano, Rosario Gennaro, Shai Halevi
ESA
2008
Springer
124views Algorithms» more  ESA 2008»
13 years 8 months ago
Collusion-Resistant Mechanisms with Verification Yielding Optimal Solutions
A truthful mechanism consists of an algorithm augmented with a suitable payment function which guarantees that the "players" cannot improve their utilities by "chea...
Paolo Penna, Carmine Ventre
NAR
1998
101views more  NAR 1998»
13 years 6 months ago
The PRINTS protein fingerprint database in its fifth year
PRINTS is a database of protein family ‘fingerprints’ offering a diagnostic resource for newly-determined sequences. By contrast with PROSITE, which uses single consensus expr...
Terri K. Attwood, Michael E. Beck, Darren R. Flowe...
AINTEC
2006
Springer
13 years 10 months ago
A Topology-Aware Overlay Multicast Approach for Mobile Ad-Hoc Networks
AOMP (Ad-hoc Overlay Multicast Protocol) is a novel approach for application-layer multicast in ad-hoc networks. We introduce in this paper a new algorithm that exploits a few prop...
Mohamed Ali Kâafar, Cyrine Mrabet, Thierry T...