Sciweavers

187 search results - page 18 / 38
» On Garbling Schemes With And Without Privacy
Sort
View
ESORICS
2009
Springer
15 years 10 months ago
User-Centric Handling of Identity Agent Compromise
Digital identity credentials are a key enabler for important online services, but widespread theft and misuse of such credentials poses serious risks for users. We believe that an ...
Daisuke Mashima, Mustaque Ahamad, Swagath Kannan
FC
2005
Springer
104views Cryptology» more  FC 2005»
15 years 3 months ago
Event Driven Private Counters
We define and instantiate a cryptographic scheme called “private counters”, which can be used in applications such as preferential voting to express and update preferences (or...
Eu-Jin Goh, Philippe Golle
GLVLSI
2007
IEEE
162views VLSI» more  GLVLSI 2007»
15 years 4 months ago
Design of an UHF RFID transponder for secure authentication
RFID technology increases rapidly its applicability in new areas of interest without guaranteeing security and privacy issues. This paper presents a new architecture of an RFID tr...
Paolo Bernardi, Filippo Gandino, Bartolomeo Montru...
ACSAC
1999
IEEE
15 years 1 months ago
Towards a Practical, Secure, and Very Large Scale Online Election
We propose in this paper a practical and secure electronic voting protocol for large-scale online elections. Our protocol satisfies a large set of important criteria that has neve...
Jared Karro, Jie Wang
OOPSLA
1999
Springer
15 years 1 months ago
Mostly-copying Reachability-based Orthogonal Persistence
We describe how reachability-based orthogonal persistence can be supported even in uncooperative implementations of languages such as C++ and Modula-3, and without modification t...
Antony L. Hosking, Jiawan Chen