118 search results - page 9 / 24 » Ideal Secret Sharing Schemes from Permutations |
CRYPTO
2001
Springer
14 years 28 days ago
2001
Springer
Consider a scenario where an l-bit secret has been distributed among n players by an honest dealer using some secret sharing scheme. Then, if all players behave honestly, the secre...
IACR
2011
12 years 8 months ago
2011
We consider the question of how to store a value secretly on devices that continually leak information about their internal state to an external attacker. If the secret value is s...
ASIACRYPT
2000
Springer
14 years 23 days ago
2000
Springer
Abstract. Naor and Pinkas introduced metering schemes at Eurocrypt ’98 in order to decide on advertisement fees for web servers. In the schemes, any server should be able to cons...
CRYPTO
2011
Springer
12 years 8 months ago
2011
Springer
We present a somewhat homomorphic encryption scheme that is both very simple to describe and analyze, and whose security (quantumly) reduces to the worst-case hardness of problems ...
CCS
2001
ACM
14 years 2 days ago
2001
ACM
We present a mathematical construct which provides a cryptographic protocol to verifiably shuffle a sequence of k modular integers, and discuss its application to secure, universa...