Sciweavers

248 search results - page 10 / 50
» Authentication Primitives and Their Compilation
Sort
View
ICICS
2007
Springer
15 years 1 months ago
Time and Space Efficient Algorithms for Two-Party Authenticated Data Structures
Authentication is increasingly relevant to data management. Data is being outsourced to untrusted servers and clients want to securely update and query their data. For example, in ...
Charalampos Papamanthou, Roberto Tamassia
ICICS
2005
Springer
15 years 3 months ago
Security Properties of Two Authenticated Conference Key Agreement Protocols
In this paper we analyse the security of two authenticated group key agreement schemes based on the group key agreement protocol of Burmester and Desmedt. One scheme was proposed ...
Qiang Tang, Chris J. Mitchell
TACS
1997
Springer
15 years 1 months ago
Type System for Specializing Polymorphism
Abstract. Flexibility of programming and efficiency of program execution are two important features of a programming language. Unfortunately, however, there is an inherent conflict...
Atsushi Ohori
ESOP
2000
Springer
15 years 1 months ago
A Calculus for Compiling and Linking Classes
Abstract. We describe a low-level calculus, called ink (pronounced "links"), designed to serve as an intermediate representation in compilers for class-based objectorient...
Kathleen Fisher, John H. Reppy, Jon G. Riecke
DAC
2007
ACM
15 years 11 months ago
Physical Unclonable Functions for Device Authentication and Secret Key Generation
Physical Unclonable Functions (PUFs) are innovative circuit primitives that extract secrets from physical characteristics of integrated circuits (ICs). We present PUF designs that...
G. Edward Suh, Srinivas Devadas