2601 search results - page 452 / 521 » Secure Rewarding Schemes |
121
click to vote
APLAS
2007
ACM
15 years 7 months ago
2007
ACM
We propose a series of type systems for the information-flow security of assembly code. These systems extend previous work TALC with some timing annotations and associated judgment...
116
click to vote
FC
2010
Springer
15 years 6 months ago
2010
Springer
This paper presents compact message formats for onion routing circuit construction using the Sphinx methodology developed for mixes. We significantly compress the circuit constru...
123
Voted
ASIACRYPT
2006
Springer
15 years 6 months ago
2006
Springer
We introduce KFC, a block cipher based on a three round Feistel scheme. Each of the three round functions has an SPN-like structure for which we can either compute or bound the adv...
122
click to vote
CRYPTO
2006
Springer
15 years 6 months ago
2006
Springer
We present an identity-based cryptosystem that features fully anonymous ciphertexts and hierarchical key delegation. We give a proof of security in the standard model, based on the...
125
click to vote
CTRSA
2006
Springer
15 years 6 months ago
2006
Springer
We construct efficient universally composable oblivious transfer protocols in the multi-party setting for honest majorities. Unlike previous proposals our protocols are designed in...