Sciweavers

241 search results - page 14 / 49
» Machine-Checked Security Proofs of Cryptographic Signature S...
Sort
View
CSFW
2010
IEEE
14 years 15 days ago
Impossibility Results for Secret Establishment
—Security protocol design is a creative discipline where the solution space depends on the problem to be solved and the cryptographic operators available. In this paper, we exami...
Benedikt Schmidt, Patrick Schaller, David A. Basin
ICICS
2005
Springer
14 years 2 months ago
Generic Construction of (Identity-Based) Perfect Concurrent Signatures
The notion of concurrent signatures was recently introduced by Chen, Kudla and Paterson. In concurrent signature schemes, two entities can produce two signatures that are not bindi...
Sherman S. M. Chow, Willy Susilo
EUROCRYPT
2005
Springer
14 years 2 months ago
3-Move Undeniable Signature Scheme
In undeniable signature schemes, zero-knowledgeness and non-transferability have been identified so far. In this paper, by separating these two notions, we show the first 3-move ...
Kaoru Kurosawa, Swee-Huay Heng
DCC
2005
IEEE
14 years 8 months ago
Signcryption with Non-interactive Non-repudiation
Signcryption [35] is a public key primitive that achieves the functionality of both an encryption scheme and a signature scheme simultaneously. It does this more efficiently than a...
John Malone-Lee
IACR
2011
136views more  IACR 2011»
12 years 8 months ago
Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
We give new methods for generating and using “strong trapdoors” in cryptographic lattices, which are simultaneously simple, efficient, easy to implement (even in parallel), a...
Daniele Micciancio, Chris Peikert