Sciweavers

1518 search results - page 154 / 304
» Cryptographic Test Correction
Sort
View
129
Voted
STOC
1996
ACM
185views Algorithms» more  STOC 1996»
15 years 5 months ago
Adaptively Secure Multi-Party Computation
A fundamental problem in designing secure multi-party protocols is how to deal with adaptive adversaries i.e., adversaries that may choose the corrupted parties during the course ...
Ran Canetti, Uriel Feige, Oded Goldreich, Moni Nao...
116
Voted
FOCS
2004
IEEE
15 years 4 months ago
Shuffling by Semi-Random Transpositions
In the cyclic-to-random shuffle, we are given n cards arranged in a circle. At step k, we exchange the k'th card along the circle with a uniformly chosen random card. The pro...
Elchanan Mossel, Yuval Peres, Alistair Sinclair
142
Voted
CRYPTO
2008
Springer
186views Cryptology» more  CRYPTO 2008»
15 years 2 months ago
Communication Complexity in Algebraic Two-Party Protocols
In cryptography, there has been tremendous success in building various two-party protocols with small communication complexity out of homomorphic semantically-secure encryption sc...
Rafail Ostrovsky, William E. Skeith III
EUROCRYPT
2008
Springer
15 years 2 months ago
The Twin Diffie-Hellman Problem and Applications
ded abstract of this paper appears in Advances in Cryptology -- EUROCRYPT '08, Lecture Notes in Computer Science Vol. 4965, N. Smart ed., Springer-Verlag, 2008. This is the fu...
David Cash, Eike Kiltz, Victor Shoup
129
Voted
CORR
2010
Springer
121views Education» more  CORR 2010»
15 years 1 months ago
GNSS-based positioning: Attacks and Countermeasures
Increasing numbers of mobile computing devices, user-portable, or embedded in vehicles, cargo containers, or the physical space, need to be aware of their location in order to prov...
P. Papadimitratos, A. Jovanovic