Sciweavers

352 search results - page 22 / 71
» Cryptography in the Multi-string Model
Sort
View
COCO
1993
Springer
133views Algorithms» more  COCO 1993»
14 years 1 months ago
On Span Programs
We introduce a linear algebraic model of computation, the Span Program, and prove several upper and lower bounds on it. These results yield the following applications in complexit...
Mauricio Karchmer, Avi Wigderson
PST
2004
13 years 11 months ago
Practical Remote Electronic Elections for the UK
Abstract-- The United Kingdom (UK) government has repeatedly expressed a desire to employ a Remote Electronic Voting (REV) system in a general election after 2006. Most existing RE...
Tim Storer, Ishbel Duncan
FDTC
2009
Springer
104views Cryptology» more  FDTC 2009»
14 years 4 months ago
Low Voltage Fault Attacks on the RSA Cryptosystem
—Fault injection attacks are a powerful tool to exploit implementative weaknesses of robust cryptographic algorithms. The faults induced during the computation of the cryptograph...
Alessandro Barenghi, Guido Bertoni, Emanuele Parri...
NSPW
2004
ACM
14 years 3 months ago
Symmetric behavior-based trust: a new paradigm for internet computing
Current models of Internet Computing are highly asymmetric – a host protects itself from malicious mobile Java programs, but there is no way to get assurances about the behavior...
Vivek Haldar, Michael Franz
PKC
2007
Springer
160views Cryptology» more  PKC 2007»
14 years 4 months ago
Anonymous Signatures Made Easy
Abstract. At PKC 2006, Yang, Wong, Deng and Wang proposed the notion of anonymous signature schemes where signatures do not reveal the signer’s identity, as long as some parts of...
Marc Fischlin