Sciweavers

88 search results - page 11 / 18
» Long-Term Security and Universal Composability
Sort
View
IJISEC
2007
87views more  IJISEC 2007»
13 years 7 months ago
Breaking four mix-related schemes based on Universal Re-encryption
Universal Re-encryption allows El-Gamal ciphertexts to be re-encrypted without knowledge of their corresponding public keys. This has made it an enticing building block for anonymo...
George Danezis
IFIP
2010
Springer
13 years 2 months ago
Reasoning about Probabilistic Security Using Task-PIOAs
Abstract. Task-structured probabilistic input/output automata (taskPIOAs) are concurrent probabilistic automata that, among other things, have been used to provide a formal framewo...
Aaron D. Jaggard, Catherine Meadows, Michael Mislo...
CCGRID
2005
IEEE
14 years 1 months ago
Experiences in teaching grid computing to advanced level students
The development of teaching materials for future software engineers is critical to the long term success of the Grid. At present however there is considerable turmoil in the Grid ...
Richard O. Sinnott, A. J. Stell, J. P. Watt
TCC
2009
Springer
160views Cryptology» more  TCC 2009»
14 years 8 months ago
Simple, Black-Box Constructions of Adaptively Secure Protocols
We present a compiler for transforming an oblivious transfer (OT) protocol secure against an adaptive semi-honest adversary into one that is secure against an adaptive malicious ad...
Seung Geol Choi, Dana Dachman-Soled, Tal Malkin, H...
CRYPTO
2005
Springer
137views Cryptology» more  CRYPTO 2005»
14 years 1 months ago
A Formal Treatment of Onion Routing
Anonymous channels are necessary for a multitude of privacy-protecting protocols. Onion routing is probably the best known way to achieve anonymity in practice. However, the crypto...
Jan Camenisch, Anna Lysyanskaya