Sciweavers

1518 search results - page 104 / 304
» Cryptographic Test Correction
Sort
View
122
Voted
ACNS
2005
Springer
84views Cryptology» more  ACNS 2005»
15 years 9 months ago
Non-interactive Zero-Knowledge Arguments for Voting
Abstract. In voting based on homomorphic threshold encryption, the voter encrypts his vote and sends it in to the authorities that tally the votes. If voters can send in arbitrary ...
Jens Groth
134
Voted
FSTTCS
2003
Springer
15 years 9 months ago
Tagging Makes Secrecy Decidable with Unbounded Nonces as Well
Tagging schemes have been used in security protocols to ensure that the analysis of such protocols can work with messages of bounded length. When the set of nonces is bounded, this...
Ramaswamy Ramanujam, S. P. Suresh
135
Voted
SP
2010
IEEE
226views Security Privacy» more  SP 2010»
15 years 7 months ago
Chip and PIN is Broken
—EMV is the dominant protocol used for smart card payments worldwide, with over 730 million cards in circulation. Known to bank customers as “Chip and PIN”, it is used in Eur...
Steven J. Murdoch, Saar Drimer, Ross J. Anderson, ...
133
Voted
CORR
2007
Springer
127views Education» more  CORR 2007»
15 years 3 months ago
Using decision problems in public key cryptography
There are several public key establishment protocols as well as complete public key cryptosystems based on allegedly hard problems from combinatorial (semi)group theory known by no...
Vladimir Shpilrain, Gabriel Zapata
145
Voted
ML
1998
ACM
131views Machine Learning» more  ML 1998»
15 years 3 months ago
Learning from Examples and Membership Queries with Structured Determinations
It is well known that prior knowledge or bias can speed up learning, at least in theory. It has proved di cult to make constructive use of prior knowledge, so that approximately c...
Prasad Tadepalli, Stuart J. Russell