Sciweavers

1777 search results - page 118 / 356
» Programming Cryptographic Protocols
Sort
View
SPW
2004
Springer
15 years 6 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
103
Voted
WISA
2004
Springer
15 years 6 months ago
Hyperelliptic Curve Coprocessors on a FPGA
Abstract. Cryptographic algorithms are used in a large variety of different applications to ensure security services. It is, thus, very interesting to investigate various implement...
Howon Kim, Thomas J. Wollinger, YongJe Choi, Kyoil...
IANDC
2007
152views more  IANDC 2007»
15 years 1 months ago
The reactive simulatability (RSIM) framework for asynchronous systems
We define reactive simulatability for general asynchronous systems. Roughly, simulatability means that a real system implements an ideal system (specification) in a way that pre...
Michael Backes, Birgit Pfitzmann, Michael Waidner
ECOOP
2011
Springer
14 years 1 months ago
An Empirical Study of Object Protocols in the Wild
Abstract. An active area of research in computer science is the prevention of violations of object protocols, i.e., restrictions on temporal orderings of method calls on an object....
Nels E. Beckman, Duri Kim, Jonathan Aldrich
CORR
2009
Springer
100views Education» more  CORR 2009»
14 years 11 months ago
Programming Idioms for Transactional Events
Transactional events (TE) are an extension of Concurrent ML (CML), a programming model for synchronous message-passing. Prior work has focused on TE's formal semantics and it...
Matthew Kehrt, Laura Effinger-Dean, Michael Schmit...