Sciweavers

3751 search results - page 602 / 751
» Events in security protocols
Sort
View
JCS
2010
121views more  JCS 2010»
14 years 11 months ago
Computational soundness of symbolic zero-knowledge proofs
raction of cryptographic operations by term algebras, called Dolev-Yao models, is essential in almost all tool-supported methods for proving security protocols. Recently significa...
Michael Backes, Dominique Unruh
JOC
2011
104views more  JOC 2011»
14 years 3 months ago
Short Undeniable Signatures Based on Group Homomorphisms
This paper is devoted to the design and analysis of short undeniable signatures based on a random oracle. Exploiting their online property, we can achieve signatures with a fully s...
Jean Monnerat, Serge Vaudenay
103
Voted
HPCA
2007
IEEE
16 years 1 months ago
MemTracker: Efficient and Programmable Support for Memory Access Monitoring and Debugging
Memory bugs are a broad class of bugs that is becoming increasingly common with increasing software complexity, and many of these bugs are also security vulnerabilities. Unfortuna...
Guru Venkataramani, Brandyn Roemer, Yan Solihin, M...
IPPS
2006
IEEE
15 years 6 months ago
Analysis of checksum-based execution schemes for pipelined processors
The performance requirements for contemporary microprocessors are increasing as rapidly as their number of applications grows. By accelerating the clock, performance can be gained...
Bernhard Fechner
OOPSLA
2005
Springer
15 years 6 months ago
Adding trace matching with free variables to AspectJ
An aspect observes the execution of a base program; when certain actions occur, the aspect runs some extra code of its own. In the AspectJ language, the observations that an aspec...
Chris Allan, Pavel Avgustinov, Aske Simon Christen...