Sciweavers

352 search results - page 28 / 71
» Cryptography in the Multi-string Model
Sort
View
CTRSA
2004
Springer
120views Cryptology» more  CTRSA 2004»
14 years 3 months ago
Identity Based Undeniable Signatures
Abstract. In this paper, we give a first example of identity based undeniable signature using pairings over elliptic curves. We extend to the identity based setting the security m...
Benoît Libert, Jean-Jacques Quisquater
EUROCRYPT
2004
Springer
14 years 3 months ago
Short Signatures Without Random Oracles
We describe a short signature scheme that is strongly existentially unforgeable under an adaptive chosen message attack in the standard security model. Our construction works in g...
Dan Boneh, Xavier Boyen
PKC
2004
Springer
95views Cryptology» more  PKC 2004»
14 years 3 months ago
A Nonuniform Algorithm for the Hidden Number Problem in Subgroups
Boneh and Venkatesan have proposed a polynomial time algorithm in a non-uniform model for recovering a ”hidden” element α ∈ IFp, where p is prime, from very short strings of...
Igor Shparlinski, Arne Winterhof
ICALP
2011
Springer
13 years 1 months ago
New Algorithms for Learning in Presence of Errors
We give new algorithms for a variety of randomly-generated instances of computational problems using a linearization technique that reduces to solving a system of linear equations...
Sanjeev Arora, Rong Ge
ACNS
2009
Springer
168views Cryptology» more  ACNS 2009»
14 years 4 months ago
Session-state Reveal Is Stronger Than Ephemeral Key Reveal: Attacking the NAXOS Authenticated Key Exchange Protocol
Abstract. In the paper “Stronger Security of Authenticated Key Exchange” [1,2], a new security model for authenticated key exchange protocols (eCK) is proposed. The new model i...
Cas J. F. Cremers