Sciweavers

849 search results - page 77 / 170
» Completely Non-malleable Schemes
Sort
View
117
Voted
CTRSA
2009
Springer
128views Cryptology» more  CTRSA 2009»
15 years 7 months ago
Short Redactable Signatures Using Random Trees
Abstract. A redactable signature scheme for a string of objects supports verification even if multiple substrings are removed from the original string. It is important that the re...
Ee-Chien Chang, Chee Liang Lim, Jia Xu
CRYPTO
2009
Springer
145views Cryptology» more  CRYPTO 2009»
15 years 7 months ago
Leakage-Resilient Public-Key Cryptography in the Bounded-Retrieval Model
We study the design of cryptographic primitives resilient to key-leakage attacks, where an attacker can repeatedly and adaptively learn information about the secret key, subject o...
Joël Alwen, Yevgeniy Dodis, Daniel Wichs
115
Voted
CASES
2007
ACM
15 years 4 months ago
Scratch-pad memory allocation without compiler support for java applications
ABSTRACT This paper presents the first scratch-pad memory allocation scheme that requires no compiler support for interpreted-language based applications. A scratch-pad memory (SPM...
Nghi Nguyen, Angel Dominguez, Rajeev Barua
TIP
2008
153views more  TIP 2008»
15 years 15 days ago
Generalized Flooding and Multicue PDE-Based Image Segmentation
Image segmentation remains an important, but hard-to-solve, problem since it appears to be application dependent with usually no a priori information available regarding the image ...
Anastasia Sofou, Petros Maragos
124
Voted
ADHOCNOW
2009
Springer
15 years 1 months ago
On Minimizing the Maximum Sensor Movement for Barrier Coverage of a Line Segment
We consider n mobile sensors located on a line containing a barrier represented by a finite line segment. Sensors form a wireless sensor network and are able to move within the lin...
Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc...