Sciweavers

2601 search results - page 76 / 521
» Secure Rewarding Schemes
Sort
View
CTRSA
2010
Springer
200views Cryptology» more  CTRSA 2010»
15 years 6 months ago
Resettable Public-Key Encryption: How to Encrypt on a Virtual Machine
Typical security models used for proving security of deployed cryptographic primitives do not allow adversaries to rewind or reset honest parties to an earlier state. Thus, it is c...
Scott Yilek
PROVSEC
2010
Springer
14 years 9 months ago
Identity Based Public Verifiable Signcryption Scheme
Abstract. Signcryption as a single cryptographic primitive offers both confidentiality and authentication simultaneously. Generally in signcryption schemes, the message is hidden a...
S. Sharmila Deva Selvi, S. Sree Vivek, C. Pandu Ra...
EUROCRYPT
2010
Springer
15 years 4 months ago
Constant-Round Non-malleable Commitments from Sub-exponential One-Way Functions
We present a constant-round non-malleable commitment scheme based on the existence of sub-exponential one-way functions and using a blackbox proof of security. As far as we know, t...
Rafael Pass, Hoeteck Wee
ICIP
2007
IEEE
15 years 3 months ago
Sensitivity Analysis Attacks Against Randomized Detectors
Sensitivity analysis attacks present a serious threat to the security of popular spread spectrum watermarking schemes. Randomization of the detector is thought to increase the imm...
Maha El Choubassi, Pierre Moulin
DAM
2006
121views more  DAM 2006»
14 years 12 months ago
Fine-grained forward-secure signature schemes without random oracles
We propose the concept of fine-grained forward-secure signature schemes. Such signature schemes not only provide non-repudiation w.r.t. past time periods the way ordinary forward-...
Jan Camenisch, Maciej Koprowski