Sciweavers

14 search results - page 3 / 3
» History-Dependent Scheduling for Cryptographic Processes
Sort
View
CCS
2009
ACM
14 years 2 days ago
CoSP: a general framework for computational soundness proofs
We describe CoSP, a general framework for conducting computational soundness proofs of symbolic models and for embedding these proofs into formal calculi. CoSP considers arbitrary...
Michael Backes, Dennis Hofheinz, Dominique Unruh
APLAS
2006
ACM
13 years 11 months ago
Computational Secrecy by Typing for the Pi Calculus
We define and study a distributed cryptographic implementation for an asynchronous pi calculus. At the source level, we adapt simple type systems designed for establishing formal ...
Martín Abadi, Ricardo Corin, Cédric ...
ARESEC
2011
117views more  ARESEC 2011»
12 years 5 months ago
Non-Parallelizable and Non-Interactive Client Puzzles from Modular Square Roots
—Denial of Service (DoS) attacks aiming to exhaust the resources of a server by overwhelming it with bogus requests have become a serious threat. Especially protocols that rely o...
Yves Igor Jerschow, Martin Mauve
DAC
2003
ACM
14 years 6 months ago
Design flow for HW / SW acceleration transparency in the thumbpod secure embedded system
This paper describes a case study and design flow of a secure embedded system called ThumbPod, which uses cryptographic and biometric signal processing acceleration. It presents t...
David Hwang, Bo-Cheng Lai, Patrick Schaumont, Kazu...