Sciweavers

92 search results - page 8 / 19
» Practical Problems with a Cryptographic Protection Scheme
Sort
View
JOC
2006
116views more  JOC 2006»
13 years 7 months ago
On the Fly Authentication and Signature Schemes Based on Groups of Unknown Order
Abstract. In response to the current need for fast, secure and cheap public-key cryptography, we propose an interactive zero-knowledge identification scheme and a derived signature...
Marc Girault, Guillaume Poupard, Jacques Stern
GAMESEC
2010
244views Game Theory» more  GAMESEC 2010»
13 years 5 months ago
The Password Game: Negative Externalities from Weak Password Practices
The combination of username and password is widely used as a human authentication mechanism on the Web. Despite this universal adoption and despite their long tradition, password s...
Sören Preibusch, Joseph Bonneau
ASIACRYPT
2011
Springer
12 years 7 months ago
The Leakage-Resilience Limit of a Computational Problem Is Equal to Its Unpredictability Entropy
A cryptographic assumption is the (unproven) mathematical statement that a certain computational problem (e.g. factoring integers) is computationally hard. The leakage-resilience l...
Divesh Aggarwal, Ueli Maurer
PKC
2009
Springer
140views Cryptology» more  PKC 2009»
14 years 8 months ago
An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials
Abstract. The success of electronic authentication systems, be it eID card systems or Internet authentication systems such as CardSpace, highly depends on the provided level of use...
Jan Camenisch, Markulf Kohlweiss, Claudio Soriente
ICALP
2005
Springer
14 years 1 months ago
Completely Non-malleable Schemes
Abstract An encryption scheme is non-malleable if the adversary cannot transform a ciphertext into one of a related message under the given public key. Although providing a very st...
Marc Fischlin