Sciweavers

4636 search results - page 115 / 928
» Modelling and Validation with VipTool
Sort
View
IJIT
2004
13 years 9 months ago
Practical Fair Anonymous Undeniable Signatures
We present a new model for undeniable signatures: fair-anonymous undeniable signatures. This protocol can not only preserve the privacy of the signer (i.e. anonymity) but also trac...
Song Han, Elizabeth Chang, Xiaotie Deng, Winson K....
PKC
2004
Springer
146views Cryptology» more  PKC 2004»
14 years 1 months ago
Constructing Committed Signatures from Strong-RSA Assumption in the Standard Complexity Model
Abstract. In this paper, we provide the first committed signature provably secure in the standard complexity model based on the strong RSA assumption. The idea behind the construc...
Huafei Zhu
IJON
2010
140views more  IJON 2010»
13 years 6 months ago
Multi-task preference learning with an application to hearing aid personalization
We present an EM-algorithm for the problem of learning preferences with Gaussian processes in the context of multi-task learning. We validate our approach on an audiological data ...
Adriana Birlutiu, Perry Groot, Tom Heskes
WSC
2008
13 years 10 months ago
Applying causal inference to understand emergent behavior
Emergent behaviors in simulations require explanation, so that valid behaviors can be separated from design or coding errors. Validation of emergent behavior requires accumulation...
Ross Gore, Paul F. Reynolds Jr.
FSE
2006
Springer
121views Cryptology» more  FSE 2006»
13 years 11 months ago
The Ideal-Cipher Model, Revisited: An Uninstantiable Blockcipher-Based Hash Function
The Ideal-Cipher Model of a blockcipher is a well-known and widely-used model dating back to Shannon [24] and has seen frequent use in proving the security of various cryptographi...
John Black