Sciweavers

1064 search results - page 74 / 213
» Cryptography from Anonymity
Sort
View
PKC
2004
Springer
146views Cryptology» more  PKC 2004»
14 years 3 months ago
Constructing Committed Signatures from Strong-RSA Assumption in the Standard Complexity Model
Abstract. In this paper, we provide the first committed signature provably secure in the standard complexity model based on the strong RSA assumption. The idea behind the construc...
Huafei Zhu
EUROCRYPT
2007
Springer
14 years 3 months ago
General Ad Hoc Encryption from Exponent Inversion IBE
Among the three broad classes of Identity-Based Encryption schemes built from pairings, the exponent inversion paradigm tends to be the most efficient, but also the least extensibl...
Xavier Boyen
PAIRING
2009
Springer
117views Cryptology» more  PAIRING 2009»
14 years 4 months ago
Identity Based Group Signatures from Hierarchical Identity-Based Encryption
A number of previous papers explored the notion of identity-based group signature. We present a generic construction of identity-based group signatures. Our construction is based o...
Nigel P. Smart, Bogdan Warinschi
ISCC
2009
IEEE
170views Communications» more  ISCC 2009»
14 years 4 months ago
A directly public verifiable signcryption scheme based on elliptic curves
A directly public verifiable signcryption scheme is introduced in this paper that provides the security attributes of message confidentiality, authentication, integrity, non-repud...
Mohsen Toorani, Ali Asghar Beheshti Shirazi
WCC
2005
Springer
156views Cryptology» more  WCC 2005»
14 years 3 months ago
One and Two-Variable Interlace Polynomials: A Spectral Interpretation
We relate the one- and two-variable interlace polynomials of a graph to the spectra of a quadratic boolean function with respect to a strategic subset of local unitary transforms. ...
Constanza Riera, Matthew G. Parker