Sciweavers

391 search results - page 9 / 79
» Formal Universes
Sort
View
ASIACRYPT
2005
Springer
14 years 3 months ago
Universally Anonymizable Public-Key Encryption
Abstract. We first propose the notion of universally anonymizable publickey encryption. Suppose that we have the encrypted data made with the same security parameter, and that the...
Ryotaro Hayashi, Keisuke Tanaka
CRYPTO
2005
Springer
137views Cryptology» more  CRYPTO 2005»
14 years 3 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
KR
1989
Springer
14 years 1 months ago
Impediments to Universal Preference-Based Default Theories
Research on nonmonotonic and default reasoning has identified several important criteria for preferring alternative default inferences. The theories of reasoning based on each of...
Jon Doyle, Michael P. Wellman
CCS
2007
ACM
14 years 4 months ago
Universally composable and forward-secure RFID authentication and authenticated key exchange
Recently, a universally composable framework for RFID authentication protocols providing availability, anonymity, and authenticity was proposed. In this paper we extend that frame...
Tri Van Le, Mike Burmester, Breno de Medeiros
ALT
2003
Springer
14 years 6 months ago
On the Existence and Convergence of Computable Universal Priors
Solomonoff unified Occam’s razor and Epicurus’ principle of multiple explanations to one elegant, formal, universal theory of inductive inference, which initiated the field...
Marcus Hutter