Sciweavers

77 search results - page 14 / 16
» Security of Blind Signatures Revisited
Sort
View
JOC
2008
86views more  JOC 2008»
13 years 5 months ago
Lower Bounds and Impossibility Results for Concurrent Self Composition
In the setting of concurrent self composition, a single protocol is executed many times concurrently by a single set of parties. In this paper, we prove lower bounds and impossibi...
Yehuda Lindell
COMPSAC
2006
IEEE
13 years 12 months ago
Agent-Based Offline Electronic Voting
—Many electronic voting systems, classified mainly as homomorphic cryptography based, mix-net based and blind signature based, appear after the eighties when zero knowledge proof...
Mehmet Tahir Sandikkaya, Bülent Örencik
IEEEARES
2007
IEEE
14 years 2 days 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
BROADNETS
2005
IEEE
13 years 11 months ago
Privacy enhanced access control in pervasive computing environments
Abstract— Privacy and security are two important but seemingly contradict objectives in pervasive computing environments (PCEs). On the one hand, service providers want to authen...
Kui Ren, Wenjing Lou
PET
2004
Springer
13 years 11 months ago
Reputable Mix Networks
We define a new type of mix network that offers a reduced form of robustness: the mixnet can prove that every message it outputs corresponds to an input submitted by a player wit...
Philippe Golle