216 search results - page 32 / 44 » Formal Proofs for the Security of Signcryption |
IWFM
2003
13 years 8 months ago
2003
Meadows recently proposed a formal cost-based framework for analysis of denial of service. It was showed how some principles that have already been used to make cryptographic prot...
TPDS
1998
13 years 7 months ago
1998
- Systems of heterogeneous parallel processing are studied such as arising in parallel programs executed on distributed systems. A lower and an upper bound model are suggested to o...
ASIACRYPT
2009
Springer
14 years 2 months ago
2009
Springer
Computational puzzles are mildly difficult computational problems that require resources (processor cycles, memory, or both) to solve. Puzzles have found a variety of uses in secu...
WISA
2009
Springer
14 years 2 months ago
2009
Springer
Power analysis has shown to be successful in breaking symmetric cryptographic algorithms implemented on low resource devices. Prompted by the breaking of many protected implementat...
FSE
2008
Springer
13 years 9 months ago
2008
Springer
We propose SWIFFT, a collection of compression functions that are highly parallelizable and admit very efficient implementations on modern microprocessors. The main technique under...