Sciweavers

242 search results - page 13 / 49
» Randomness in Cryptography
Sort
View
PKC
2007
Springer
160views Cryptology» more  PKC 2007»
15 years 3 months ago
Anonymous Signatures Made Easy
Abstract. At PKC 2006, Yang, Wong, Deng and Wang proposed the notion of anonymous signature schemes where signatures do not reveal the signer’s identity, as long as some parts of...
Marc Fischlin
ACSAC
2009
IEEE
15 years 4 months ago
Privacy through Noise: A Design Space for Private Identification
To protect privacy in large systems, users must be able to authenticate against a central server without disclosing their identity to the network. Private identification protocols ...
Karsten Nohl, David Evans
CORR
2010
Springer
128views Education» more  CORR 2010»
14 years 9 months ago
Random Oracles in a Quantum World
Once quantum computers reach maturity most of today's traditional cryptographic schemes based on RSA or discrete logarithms become vulnerable to quantum-based attacks. Hence, ...
Özgür Dagdelen, Marc Fischlin, Anja Lehm...
ACNS
2006
Springer
112views Cryptology» more  ACNS 2006»
15 years 3 months ago
Password Based Server Aided Key Exchange
We propose a new password-based 3-party protocol with a formal security proof in the standard model. Under reasonable assumptions we show that our new protocol is more efficient t...
Yvonne Cliff, Yiu Shing Terry Tin, Colin Boyd
ASIACRYPT
2009
Springer
15 years 1 months ago
Hedged Public-Key Encryption: How to Protect against Bad Randomness
Abstract. Public-key encryption schemes rely for their IND-CPA security on per-message fresh randomness. In practice, randomness may be of poor quality for a variety of reasons, le...
Mihir Bellare, Zvika Brakerski, Moni Naor, Thomas ...