Sciweavers

241 search results - page 47 / 49
» Machine-Checked Security Proofs of Cryptographic Signature S...
Sort
View
INDOCRYPT
2001
Springer
13 years 10 months ago
Mobile Agent Route Protection through Hash-Based Mechanisms
Abstract. One approach to secure mobile agent execution is restricting the agent route to trusted environments. A necessary condition for this approach to be practical is that the ...
Josep Domingo-Ferrer
PET
2009
Springer
14 years 26 days ago
Privacy-Preserving Computation and Verification of Aggregate Queries on Outsourced Databases
: © Privacy-Preserving Computation and Verification of Aggregate Queries on Outsourced Databases Brian Thompson, Stuart Haber, William G. Horne, Tomas Sander, Danfeng Yao HP Labor...
Brian Thompson, Stuart Haber, William G. Horne, To...
CCS
2001
ACM
13 years 10 months ago
A verifiable secret shuffle and its application to e-voting
We present a mathematical construct which provides a cryptographic protocol to verifiably shuffle a sequence of k modular integers, and discuss its application to secure, universa...
C. Andrew Neff
CRYPTO
2006
Springer
112views Cryptology» more  CRYPTO 2006»
13 years 10 months ago
On Expected Constant-Round Protocols for Byzantine Agreement
In a seminal paper, Feldman and Micali (STOC '88) show an n-party Byzantine agreement protocol tolerating t < n/3 malicious parties that runs in expected constant rounds. H...
Jonathan Katz, Chiu-Yuen Koo
ASIACRYPT
2009
Springer
14 years 28 days ago
Foundations of Non-malleable Hash and One-Way Functions
Non-malleability is an interesting and useful property which ensures that a cryptographic protocol preserves the independence of the underlying values: given for example an encryp...
Alexandra Boldyreva, David Cash, Marc Fischlin, Bo...