Sciweavers

248 search results - page 9 / 50
» Authentication Primitives and Their Compilation
Sort
View
ICFP
2008
ACM
15 years 9 months ago
Compiling self-adjusting programs with continuations
Self-adjusting programs respond automatically and efficiently to input changes by tracking the dynamic data dependences of the computation and incrementally updating the output as...
Ruy Ley-Wild, Matthew Fluet, Umut A. Acar
CJ
2006
123views more  CJ 2006»
14 years 10 months ago
Unconditionally Secure Anonymous Encryption and Group Authentication
Anonymous channels or similar techniques that can achieve sender's anonymity play important roles in many applications. However, they will be meaningless if cryptographic prim...
Goichiro Hanaoka, Junji Shikata, Yumiko Hanaoka, H...
FC
1999
Springer
160views Cryptology» more  FC 1999»
15 years 2 months ago
Anonymous Authentication of Membership in Dynamic Groups
Abstract. We present a series of protocols for authenticating an individual’s membership in a group without revealing that individual’s identity and without restricting how the...
Stuart E. Schechter, Todd Parnell, Alexander J. Ha...
WISEC
2009
ACM
15 years 4 months ago
Jamming for good: a fresh approach to authentic communication in WSNs
While properties of wireless communications are often considered as a disadvantage from a security perspective, this work demonstrates how multipath propagation, a broadcast mediu...
Ivan Martinovic, Paul Pichota, Jens B. Schmitt
ENTCS
2007
124views more  ENTCS 2007»
14 years 9 months ago
Structuring Optimizing Transformations and Proving Them Sound
A compiler optimization is sound if the optimized program that it produces is semantically equivalent to the input program. The proofs of semantic equivalence are usually tedious....
Aditya Kanade, Amitabha Sanyal, Uday P. Khedker