Sciweavers

157 search results - page 24 / 32
» Presenting Proofs with Adapted Granularity
Sort
View
ASIACRYPT
2001
Springer
14 years 1 hour ago
Provably Secure Fair Blind Signatures with Tight Revocation
A fair blind signature scheme allows the trustee to revoke blindness so that it provides authenticity and anonymity to honest users while preventing malicious users from abusing th...
Masayuki Abe, Miyako Ohkubo
PERCOM
2010
ACM
13 years 5 months ago
Faster Bayesian context inference by using dynamic value ranges
—This paper shows how to reduce evaluation time for context inference. Probabilistic Context Inference has proven to be a good representation of the physical reality with uncerta...
Korbinian Frank, Patrick Robertson, Sergio Fortes ...
DASIP
2010
13 years 2 months ago
RVC-CAL dataflow implementations of MPEG AVC/H.264 CABAC decoding
This paper describes the implementation of the MPEG AVC CABAC entropy decoder using the RVC-CAL dataflow programming language. CABAC is the Context based Adaptive Binary Arithmeti...
Endri Bezati, Marco Mattavelli, Mickaël Raule...
DICTA
2003
13 years 8 months ago
Background Modeling and Subtraction Using a Local-linear-dependence-based Cauchy Statistical Model
:Many motion object detection algorithms rely on the process of background subtraction, an important technique which is used for detecting changes from a model of the background ...
Ying Ming, Jingjue Jiang, Jun Ming
ISW
2004
Springer
14 years 25 days ago
Low-Level Ideal Signatures and General Integrity Idealization
Abstract. Recently we showed how to justify a Dolev-Yao type model of cryptography as used in virtually all automated protocol provers under active attacks and in arbitrary protoco...
Michael Backes, Birgit Pfitzmann, Michael Waidner