195 search results - page 34 / 39 » Security and Privacy Using One-Round Zero-Knowledge Proofs |
VOTEID
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. End-to-end auditable voting systems are expected to guarantee very interesting, and often sophisticated security properties, including correctness, privacy, fairness, rec...
WISA
2009
Springer
14 years 4 months ago
2009
Springer
In CHES 2008 a generic side-channel distinguisher, Mutual Information, has been introduced to be independent of the relation between measurements and leakages as well as between le...
CSFW
2009
IEEE
14 years 1 months ago
2009
IEEE
ProVerif is one of the most successful tools for cryptographic protocol analysis. However, dealing with algebraic properties of operators such as the exclusive OR (XOR) and Diffie-...
CCS
2008
ACM
13 years 11 months ago
2008
ACM
In 1998, Blaze, Bleumer, and Strauss suggested a cryptographic primitive termed proxy re-signature in which a proxy transforms a signature computed under Alice's secret key in...
ACISP
2001
Springer
14 years 2 months ago
2001
Springer
Abstract. Many algorithmic problems, which are used to prove the security of a cryptographic system, are shown to be characterized as the subgroup membership problem. We then apply...