Sciweavers

227 search results - page 37 / 46
» On the Reachability Problem in Cryptographic Protocols
Sort
View
EUROCRYPT
1999
Springer
13 years 11 months ago
On the Performance of Hyperelliptic Cryptosystems
In this paper we discuss various aspects of cryptosystems based on hyperelliptic curves. In particular we cover the implementation of the group law on such curves and how to genera...
Nigel P. Smart
CCS
2006
ACM
13 years 11 months ago
Secure function evaluation with ordered binary decision diagrams
Privacy-preserving protocols allow multiple parties with private inputs to perform joint computation while preserving the privacy of their respective inputs. An important cryptogr...
Louis Kruger, Somesh Jha, Eu-Jin Goh, Dan Boneh
STOC
2010
ACM
193views Algorithms» more  STOC 2010»
13 years 11 months ago
Privacy Amplification with Asymptotically Optimal Entropy Loss
We study the problem of "privacy amplification": key agreement between two parties who both know a weak secret w, such as a password. (Such a setting is ubiquitous on th...
Nishanth Chandran, Bhavana Kanukurthi, Rafail Ostr...
CRYPTO
2010
Springer
171views Cryptology» more  CRYPTO 2010»
13 years 8 months ago
Credential Authenticated Identification and Key Exchange
Secure two-party authentication and key exchange are fundamental problems. Traditionally, the parties authenticate each other by means of their identities, using a public-key infr...
Jan Camenisch, Nathalie Casati, Thomas Groß,...
CTRSA
2010
Springer
149views Cryptology» more  CTRSA 2010»
14 years 2 months ago
Usable Optimistic Fair Exchange
Fairly exchanging digital content is an everyday problem. It has been shown that fair exchange cannot be done without a trusted third party (called the Arbiter). Yet, even with a ...
Alptekin Küpçü, Anna Lysyanskaya