Sciweavers

4111 search results - page 422 / 823
» Security, Protocols, and Trust
Sort
View
176
Voted
ASIACRYPT
2005
Springer
16 years 1 months ago
Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation
Abstract. We give improved upper bounds on the communication complexity of optimally-resilient secure multiparty computation in the cryptographic model. We consider evaluating an n...
Martin Hirt, Jesper Buus Nielsen
192
Voted
ICALP
2005
Springer
16 years 1 months ago
Password-Based Encryption Analyzed
Abstract. The use of passwords in security protocols is particularly delicate because of the possibility of off-line guessing attacks. We study password-based protocols in the cont...
Martín Abadi, Bogdan Warinschi
226
Voted
FORTE
2003
15 years 9 months ago
A Lightweight Formal Analysis of a Multicast Key Management Scheme
Abstract. This paper describes the analysis of Pull-Based Asynchronous Rekeying Framework (ARF), a recently proposed solution to the scalable group key management problem in secure...
Mana Taghdiri, Daniel Jackson
188
Voted
IEEEARES
2007
IEEE
16 years 2 months ago
A Practical Verifiable e-Voting Protocol for Large Scale Elections over a Network
We propose a practical verifiable e-voting protocol which guarantees e-voting requirements: privacy, eligibility, uniqueness, uncoercibility, fairness, accuracy, robustness, indiv...
Orhan Cetinkaya, Ali Doganaksoy
261
Voted
IEEEARES
2007
IEEE
16 years 2 months ago
Pseudo-Voter Identity (PVID) Scheme for e-Voting Protocols
Voter anonymity, also known as unlinkability, is the primary requirement to satisfy privacy in e-voting protocols. Up until now, e-voting protocols have tried to make communicatio...
Orhan Cetinkaya, Ali Doganaksoy