Sciweavers

403 search results - page 56 / 81
» An algebra for commitment protocols
Sort
View
ASIACRYPT
2009
Springer
15 years 6 months ago
A Framework for Universally Composable Non-committing Blind Signatures
A universally composable (UC) blind signature functionality requres users to commit to the message to be blindly signed. It is thereby impossible to realize in the plain model. Th...
Masayuki Abe, Miyako Ohkubo
ACISP
2007
Springer
15 years 6 months ago
A Practical System for Globally Revoking the Unlinkable Pseudonyms of Unknown Users
We propose the first single sign-on system in which a user can access services using unlinkable digital pseudonyms that can all be revoked in case she abuses any one service. Our ...
Stefan Brands, Liesje Demuynck, Bart De Decker
TCC
2007
Springer
145views Cryptology» more  TCC 2007»
15 years 6 months ago
(Password) Authenticated Key Establishment: From 2-Party to Group
Abstract. A protocol compiler is described, that transforms any provably secure authenticated 2-party key establishment into a provably secure authenticated group key establishment...
Michel Abdalla, Jens-Matthias Bohli, Maria Isabel ...
ACSAC
2005
IEEE
15 years 5 months ago
Layering Public Key Distribution Over Secure DNS using Authenticated Delegation
We present the Internet Key Service (IKS), a distributed architecture for authenticated distribution of public keys, layered on Secure DNS (DNSSEC). Clients use DNSSEC to securely...
John P. Jones, Daniel F. Berger, Chinya V. Ravisha...
CRYPTO
2005
Springer
116views Cryptology» more  CRYPTO 2005»
15 years 5 months ago
New Monotones and Lower Bounds in Unconditional Two-Party Computation
Since bit and string oblivious transfer and commitment, two primitives of paramount importance in secure two- and multi-party computation, cannot be realized in an unconditionally ...
Stefan Wolf, Jürg Wullschleger