Sciweavers

2421 search results - page 66 / 485
» Message from the Editor-in-Chief
Sort
View
PROVSEC
2010
Springer
13 years 5 months ago
Efficient Confirmer Signatures from the "Signature of a Commitment" Paradigm
Generic constructions of designated confirmer signatures follow one of the following two strategies; either produce a digital signature on the message to be signed, then encrypt th...
Laila El Aimani
CRYPTO
2004
Springer
130views Cryptology» more  CRYPTO 2004»
14 years 1 months ago
Signature Schemes and Anonymous Credentials from Bilinear Maps
Abstract. We propose a new and efficient signature scheme that is provably secure in the plain model. The security of our scheme is based on a discrete-logarithm-based assumption p...
Jan Camenisch, Anna Lysyanskaya
CIE
2008
Springer
13 years 9 months ago
Succinct NP Proofs from an Extractability Assumption
Abstract We prove, using a non-standard complexity assumption, that any language in NP has a 1-round (that is, the verifier sends a message to the prover, and the prover sends a me...
Giovanni Di Crescenzo, Helger Lipmaa
IJNSEC
2011
108views more  IJNSEC 2011»
13 years 2 months ago
Cryptanalysis and Fixed of Short Signature Scheme without Random Oracle from Bilinear Parings
We first analyze the security of a short signature scheme without random oracles called ZCSM scheme and point out that it cannot support unforgeable under the chosen message and ...
Mingwu Zhang, Bo Yang, Yusheng Zhong, Pengcheng Li...
UM
2010
Springer
14 years 23 days ago
Bayesian Credibility Modeling for Personalized Recommendation in Participatory Media
In this paper, we focus on the challenge that users face in processing messages on the web posted in participatory media settings, such as blogs. It is desirable to recommend to us...
Aaditeshwar Seth, Jie Zhang, Robin Cohen