2601 search results - page 365 / 521 » Secure Rewarding Schemes |
125
click to vote
CCS
2007
ACM
15 years 10 months ago
2007
ACM
In this paper, we define and explore proofs of retrievability (PORs). A POR scheme enables an archive or back-up service (prover) to produce a concise proof that a user (verifier...
139
click to vote
ACNS
2010
Springer
15 years 8 months ago
2010
Springer
Verifiably encrypted signature schemes (VES) allow a signer to encrypt his or her signature under the public key of a trusted third party, while maintaining public signature verifi...
157
Voted
IACR
2011
14 years 4 months ago
2011
We put forward a generalization of lossy trapdoor functions (LTFs). Namely, all-but-many lossy trapdoor functions (ABM-LTFs) are LTFs that are parametrized with tags. Each tag can...
161
click to vote
ESORICS
2009
Springer
16 years 5 months ago
2009
Springer
Abstract. Several generic constructions for transforming one-way functions to asymmetric encryption schemes have been proposed. One-way functions only guarantee the weak secrecy of...
145
click to vote
CRYPTO
2003
Springer
15 years 9 months ago
2003
Springer
We deal with computational assumptions needed in order to design secure cryptographic schemes. We suggest a classi£cation of such assumptions based on the complexity of falsifying...