Sciweavers

112 search results - page 15 / 23
» Security proofs for an efficient password-based key exchange
Sort
View
ESORICS
2003
Springer
15 years 4 months ago
Symmetric Authentication within a Simulatable Cryptographic Library
Abstract. Proofs of security protocols typically employ simple abstractions of cryptographic operations, so that large parts of such proofs pendent of cryptographic details. The ty...
Michael Backes, Birgit Pfitzmann, Michael Waidner
CRYPTO
2010
Springer
167views Cryptology» more  CRYPTO 2010»
15 years 4 days ago
Multiparty Computation for Dishonest Majority: From Passive to Active Security at Low Cost
Multiparty computation protocols have been known for more than twenty years now, but due to their lack of efficiency their use is still limited in real-world applications: the goal...
Ivan Damgård, Claudio Orlandi
112
Voted
PET
2012
Springer
13 years 1 months ago
Fault-Tolerant Privacy-Preserving Statistics
Real-time statistics on smart meter consumption data must preserve consumer privacy and tolerate smart meter failures. Existing protocols for this private distributed aggregation m...
Marek Jawurek, Florian Kerschbaum
CTRSA
2006
Springer
140views Cryptology» more  CTRSA 2006»
15 years 2 months ago
Session Corruption Attack and Improvements on Encryption Based MT-Authenticators
Bellare, Canetti and Krawczyk proposed a security model (BCK-model) for authentication and key exchange protocols in 1998. The model not only reasonably captures the power of pract...
Xiaojian Tian, Duncan S. Wong
DCC
2000
IEEE
14 years 11 months ago
Discrete Logarithms: The Past and the Future
The first practical public key cryptosystem to be published, the Diffie-Hellman key exchange algorithm, was based on the assumption that discrete logarithms are hard to compute. T...
Andrew M. Odlyzko