Sciweavers

94 search results - page 9 / 19
» A Machine-Checked Formalization of the Generic Model and the...
Sort
View
CTRSA
2005
Springer
154views Cryptology» more  CTRSA 2005»
14 years 28 days ago
Fast and Proven Secure Blind Identity-Based Signcryption from Pairings
We present the first blind identity-based signcryption (BIBSC). We formulate its security model and define the security notions of blindness and parallel one-more unforgeability ...
Tsz Hon Yuen, Victor K. Wei
CCS
2010
ACM
13 years 7 months ago
Computational indistinguishability logic
Computational Indistinguishability Logic (CIL) is a logic for reasoning about cryptographic primitives in computational models. It captures reasoning patterns that are common in p...
Gilles Barthe, Marion Daubignard, Bruce M. Kapron,...
CRYPTO
2000
Springer
133views Cryptology» more  CRYPTO 2000»
13 years 11 months ago
Provably Secure Partially Blind Signatures
Partially blind signature schemes are an extension of blind signature schemes that allow a signer to explicitly include necessary information (expiration date, collateral condition...
Masayuki Abe, Tatsuaki Okamoto
ACISP
2009
Springer
14 years 2 months ago
Building Key-Private Public-Key Encryption Schemes
In the setting of identity-based encryption with multiple trusted authorities, TA anonymity formally models the inability of an adversary to distinguish two ciphertexts correspondi...
Kenneth G. Paterson, Sriramkrishnan Srinivasan
EUROCRYPT
1998
Springer
13 years 11 months ago
Strengthened Security for Blind Signatures
Abstract. Provable security is a very nice property for cryptographic protocols. Unfortunately, in many cases, this is at the cost of a considerable loss in terms of efficiency. Mo...
David Pointcheval