Sciweavers

28 search results - page 1 / 6
» Security Proof of the Original SOK-IBS Scheme
Sort
View
IJNSEC
2007
115views more  IJNSEC 2007»
13 years 7 months ago
Security Proof of the Original SOK-IBS Scheme
The identity-based signature (IBS) scheme proposed by Sakai, Ohgishi and Kasahara in 2000, which we refer to as the SOK-IBS scheme, is the first pairing-based IBS scheme. Though ...
Xiao-Ming Lu, Dengguo Feng
SP
2009
IEEE
114views Security Privacy» more  SP 2009»
14 years 2 months ago
Formally Certifying the Security of Digital Signature Schemes
We present two machine-checked proofs of the existential unforgeability under adaptive chosen-message attacks of the Full Domain Hash signature scheme. These proofs formalize the ...
Santiago Zanella Béguelin, Gilles Barthe, B...
ACISP
2008
Springer
14 years 1 months ago
A Critical Analysis and Improvement of AACS Drive-Host Authentication
Abstract. This paper presents a critical analysis of the AACS drivehost authentication scheme. A few weaknesses are identified which could lead to various attacks on the scheme. I...
Jiayuan Sui, Douglas R. Stinson
TCC
2010
Springer
178views Cryptology» more  TCC 2010»
14 years 4 months ago
Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems
We present a variant of Regev’s cryptosystem first presented in [Reg05], but with a new choice of parameters. By a recent classical reduction by Peikert we prove the scheme sema...
Rikke Bendlin, Ivan Damgård
IEICET
2006
108views more  IEICET 2006»
13 years 7 months ago
Plaintext Simulatability
We propose a new security class, called plaintext-simulatability, defined over the public-key encryption schemes. The notion of plaintext simulatability (denoted PS) is similar to ...
Eiichiro Fujisaki