Sciweavers

2492 search results - page 209 / 499
» On the General Signature Trees
Sort
View
ENTCS
2007
116views more  ENTCS 2007»
15 years 6 months ago
A Logical Characterisation of Static Equivalence
The work of Abadi and Fournet introduces the notion of a frame to describe the knowledge of the environment of a cryptographic protocol. Frames are lists of terms; two frames are ...
Hans Hüttel, Michael D. Pedersen
ICFHR
2010
139views Biometrics» more  ICFHR 2010»
15 years 1 months ago
A Comparative Evaluation of Finger-Drawn Graphical Password Verification Methods
Abstract--Doodle-based graphical passwords represent a challenging scenario due to their high variability and the tendency to be graphically simple. Despite this, doodle-based auth...
Marcos Martinez-Diaz, C. Martin-Diaz, Javier Galba...
FC
2000
Springer
127views Cryptology» more  FC 2000»
15 years 10 months ago
Blind, Auditable Membership Proofs
Auditability is an important property in nancial systems and architectures. Here we de ne the primitive of blind auditable membership proof" BAMP which combines public auditab...
Tomas Sander, Amnon Ta-Shma, Moti Yung
RTA
2010
Springer
15 years 10 months ago
Computing Critical Pairs in 2-Dimensional Rewriting Systems
Rewriting systems on words are very useful in the study of monoids. In good cases, they give finite presentations of the monoids, allowing their manipulation by a computer. Even b...
Samuel Mimram
STOC
2003
ACM
171views Algorithms» more  STOC 2003»
16 years 6 months ago
Primal-dual meets local search: approximating MST's with nonuniform degree bounds
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
Jochen Könemann, R. Ravi