Sciweavers

632 search results - page 59 / 127
» Two Facets of Authentication
Sort
View
COMPGEOM
1995
ACM
14 years 13 days ago
How Good are Convex Hull Algorithms?
A convex polytope P can be speci ed in two ways: as the convex hull of the vertex set V of P, or as the intersection of the set H of its facet-inducing halfspaces. The vertex enum...
David Avis, David Bremner
SODA
2012
ACM
196views Algorithms» more  SODA 2012»
11 years 11 months ago
Polytope approximation and the Mahler volume
The problem of approximating convex bodies by polytopes is an important and well studied problem. Given a convex body K in Rd , the objective is to minimize the number of vertices...
Sunil Arya, Guilherme Dias da Fonseca, David M. Mo...
INFOCOM
1998
IEEE
14 years 1 months ago
Compact and Unforgeable Key Establishment over an ATM Network
Authenticated session key establishment is a central issue in network security. This paper addresses a question on whether we can design a compact, efficient and authenticated key ...
Yuliang Zheng, Hideki Imai
ESORICS
2008
Springer
13 years 10 months ago
Dismantling MIFARE Classic
The mifare Classic is a contactless smart card that is used extensively in access control for office buildings, payment systems for public transport, and other applications. We rev...
Flavio D. Garcia, Gerhard de Koning Gans, Ruben Mu...
TIT
2010
130views Education» more  TIT 2010»
13 years 3 months ago
Pseudo-random functions and parallelizable modes of operations of a block cipher
This paper considers the construction and analysis of pseudo-random functions (PRFs) with specific reference to modes of operations of a block cipher. In the context of message aut...
Palash Sarkar