Sciweavers

1256 search results - page 80 / 252
» A Simple E-Voting Protocol
Sort
View
ICASSP
2011
IEEE
14 years 8 months ago
Capacity maximization for distributed beamforming in one- and bi-directional relay networks
In cooperative networks, users share their resources to establish reliable connections between each other. If two users want to communicate through a cooperative network, differen...
Adrian Schad, Alex B. Gershman, Shahram Shahbazpan...
IWCMC
2009
ACM
15 years 11 months ago
Probabilistic counter-based route discovery for mobile ad hoc networks
Conventional on-demand route discovery for ad hoc routing protocols extensively use simple flooding, which could potentially lead to high channel contention, causing redundant ret...
Aminu Mohammed, Mohamed Ould-Khaoua, Lewis M. Mack...
MDM
2007
Springer
123views Communications» more  MDM 2007»
15 years 10 months ago
Group Anti-Entropy - Achieving Eventual Consistency in Mobile Service Environments
Data consistency protocols are vital ingredients of mobile data management systems. Notable research efforts have been spent to find adequate consistency models for allowing mobi...
Klaus Herrmann
CTRSA
2005
Springer
72views Cryptology» more  CTRSA 2005»
15 years 10 months ago
Proofs for Two-Server Password Authentication
Traditional password-based authentication and key-exchange protocols suffer from the simple fact that a single server stores the sensitive user password. In practice, when such a ...
Michael Szydlo, Burton S. Kaliski Jr.
ACNS
2003
Springer
193views Cryptology» more  ACNS 2003»
15 years 9 months ago
Round Optimal Distributed Key Generation of Threshold Cryptosystem Based on Discrete Logarithm Problem
Distributed key generation is one of the most challenging tasks for threshold cryptosystems. Designing such a protocol and proving its security against a malicious, adaptive adver...
Rui Zhang 0002, Hideki Imai