Sciweavers

1970 search results - page 41 / 394
» Security Without Firewalls
Sort
View
IJNSEC
2011
108views more  IJNSEC 2011»
13 years 4 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...
CCS
2006
ACM
14 years 1 months ago
Virtual monotonic counters and count-limited objects using a TPM without a trusted OS
A trusted monotonic counter is a valuable primitive that enables a wide variety of highly scalable offline and decentralized applications that would otherwise be prone to replay a...
Luis F. G. Sarmenta, Marten van Dijk, Charles W. O...
EUROCRYPT
2006
Springer
14 years 1 months ago
Sequential Aggregate Signatures and Multisignatures Without Random Oracles
We present the first aggregate signature, the first multisignature, and the first verifiably encrypted signature provably secure without random oracles. Our constructions derive f...
Steve Lu, Rafail Ostrovsky, Amit Sahai, Hovav Shac...
AFRICACRYPT
2010
Springer
14 years 4 months ago
Fair Blind Signatures without Random Oracles
A fair blind signature is a blind signature with revocable anonymity and unlinkability, i.e., an authority can link an issuing session to the resulting signature and trace a signat...
Georg Fuchsbauer, Damien Vergnaud
ISW
2007
Springer
14 years 3 months ago
Identity-Based Proxy Re-encryption Without Random Oracles
A proxy re-encryption scheme allows Alice to temporarily delegate the decryption rights to Bob via a proxy. Alice gives the proxy a re-encryption key so that the proxy can convert ...
Cheng-Kang Chu, Wen-Guey Tzeng