Sciweavers

1562 search results - page 188 / 313
» Mathematics, Cryptology, Security
Sort
View
FC
2006
Springer
109views Cryptology» more  FC 2006»
13 years 12 months ago
A Private Stable Matching Algorithm
Existing stable matching algorithms reveal the preferences of all participants, as well as the history of matches made and broken in the course of computing a stable match. This in...
Philippe Golle
FDTC
2006
Springer
102views Cryptology» more  FDTC 2006»
13 years 12 months ago
Cryptographic Key Reliable Lifetimes: Bounding the Risk of Key Exposure in the Presence of Faults
With physical attacks threatening the security of current cryptographic schemes, no security policy can be developed without taking into account the physical nature of computation....
Alfonso De Gregorio
FSE
2006
Springer
166views Cryptology» more  FSE 2006»
13 years 12 months ago
A New Mode of Encryption Providing a Tweakable Strong Pseudo-random Permutation
We present PEP, which is a new construction of a tweakable strong pseudo-random permutation. PEP uses a hash-encrypt-hash approach which has recently been used in the construction...
Debrup Chakraborty, Palash Sarkar
EUROCRYPT
2000
Springer
13 years 12 months ago
Computing Inverses over a Shared Secret Modulus
We discuss the following problem: Given an integer shared secretly among n players and a prime number e, how can the players efficiently compute a sharing of e-1 mod . The most in...
Dario Catalano, Rosario Gennaro, Shai Halevi
EUROCRYPT
2000
Springer
13 years 12 months ago
Efficient Receipt-Free Voting Based on Homomorphic Encryption
Voting schemes that provide receipt-freeness prevent voters from proving their cast vote, and hence thwart vote-buying and coercion. We analyze the security of the multi-authority ...
Martin Hirt, Kazue Sako