54 search results - page 5 / 11 » Efficient Protocols for Set Membership and Range Proofs |
PKC
2009
Springer
15 years 10 months ago
2009
Springer
Similar to verifiable shuffling (or, mixing), we consider the problem of verifiable rotating (and random re-encrypting) a given list of homomorphic encryptions. The offset by which...
ISCIS
2003
Springer
15 years 2 months ago
2003
Springer
Increasing popularity of wireless services has triggered the need for efficient wireless transport mechanisms. TCP, being the reliable transport level protocol widely used in wired...
EUROCRYPT
2000
Springer
15 years 1 months ago
2000
Springer
Cryptography is more and more concerned with elaborate protocols involving many participants. In some cases, it is crucial to be sure that players behave fairly especially when the...
CSFW
2009
IEEE
15 years 1 months ago
2009
IEEE
ProVerif is one of the most successful tools for cryptographic protocol analysis. However, dealing with algebraic properties of operators such as the exclusive OR (XOR) and Diffie-...
ASIACRYPT
2008
Springer
14 years 11 months ago
2008
Springer
In an oblivious transfer (OT) protocol, a Sender with messages M1, . . . , MN and a Receiver with indices 1, . . . , k [1, N] interact in such a way that at the end the Receiver ...