793 search results - page 26 / 159 » Argumentation and standards of proof |
149
click to vote
ACNS
2010
Springer
15 years 11 months ago
2010
Springer
We look at the problem of designing Message Recognition Protocols (MRP) and note that all proposals available in the literature have relied on security proofs which hold in the ran...
195
click to vote
ASIACRYPT
2006
Springer
15 years 9 months ago
2006
Springer
This paper presents a secure constant-round password-based group key exchange protocol in the common reference string model. Our protocol is based on the group key exchange protoco...
161
click to vote
ACISP
2008
Springer
15 years 8 months ago
2008
Springer
We consider one-round key exchange protocols secure in the standard model. The security analysis uses the powerful security model of Canetti and Krawczyk and a natural extension of...
154
click to vote
FOCS
2009
IEEE
16 years 25 days ago
2009
IEEE
We prove the existence of an algorithm A for computing 2-d or 3-d convex hulls that is optimal for every point set in the following sense: for every set S of n points and for ever...
178
click to vote
APPROX
2007
Springer
16 years 8 days ago
2007
Springer
Abstract. A fundamental goal of computational complexity (and foundations of cryptography) is to find a polynomial-time samplable distribution (e.g., the uniform distribution) and...