Sciweavers

284 search results - page 55 / 57
» Securing digital signatures for non-repudiation
Sort
View
IJACT
2010
67views more  IJACT 2010»
13 years 5 days ago
On message recognition protocols: recoverability and explicit confirmation
: We look at message recognition protocols (MRPs) and prove that there is a oneto-one correspondence between stateless non-interactive MRPs and digital signature schemes. Next, we ...
Ian Goldberg, Atefeh Mashatan, Douglas R. Stinson
EUROSYS
2006
ACM
14 years 2 months ago
Reducing TCB complexity for security-sensitive applications: three case studies
The large size and high complexity of securitysensitive applications and systems software is a primary cause for their poor testability and high vulnerability. One approach to all...
Lenin Singaravelu, Calton Pu, Hermann Härtig,...
ANCS
2006
ACM
13 years 11 months ago
WormTerminator: an effective containment of unknown and polymorphic fast spreading worms
The fast spreading worm is becoming one of the most serious threats to today’s networked information systems. A fast spreading worm could infect hundreds of thousands of hosts w...
Songqing Chen, Xinyuan Wang, Lei Liu, Xinwen Zhang
SPW
2004
Springer
13 years 10 months ago
The Dancing Bear: A New Way of Composing Ciphers
This note presents a new way of composing cryptographic primitives which makes some novel combinations possible. For example, one can do threshold decryption using standard block c...
Ross Anderson
HICSS
2006
IEEE
261views Biometrics» more  HICSS 2006»
13 years 11 months ago
e-Risk Management with Insurance: A Framework Using Copula Aided Bayesian Belief Networks
: e-business organizations are heavily dependent on distributed 24X7 robust information computing systems, for their daily operations. To secure distributed online transactions, th...
Arunabha Mukhopadhyay, Samir Chatterjee, Debashis ...