Sciweavers

798 search results - page 64 / 160
» Proving More Properties with Bounded Model Checking
Sort
View
IJNSEC
2010
133views more  IJNSEC 2010»
14 years 11 months ago
Verifiable Attribute Based Encryption
In this paper, we construct two verifiable attribute-based encryption (VABE) schemes. One is with a single authority, and the other is with multi authorities. Not only our schemes ...
Qiang Tang, Dongyao Ji
COCO
2010
Springer
139views Algorithms» more  COCO 2010»
15 years 8 months ago
On Matrix Rigidity and Locally Self-Correctable Codes
We describe a new approach for the problem of finding rigid matrices, as posed by Valiant [Val77], by connecting it to the, seemingly unrelated, problem of proving lower bounds f...
Zeev Dvir
EUROCRYPT
2003
Springer
15 years 9 months ago
New Bounds in Secret-Key Agreement: The Gap between Formation and Secrecy Extraction
Perfectly secret message transmission can be realized with only partially secret and weakly correlated information shared by the parties as soon as this information allows for the ...
Renato Renner, Stefan Wolf
IS
2012
13 years 12 months ago
On the refactoring of activity labels in business process models
Large corporations increasingly utilize business process models for documenting and redesigning their operations. The extent of such modeling initiatives with several hundred mode...
Henrik Leopold, Sergey Smirnov 0002, Jan Mendling
FSTTCS
2003
Springer
15 years 9 months ago
Tagging Makes Secrecy Decidable with Unbounded Nonces as Well
Tagging schemes have been used in security protocols to ensure that the analysis of such protocols can work with messages of bounded length. When the set of nonces is bounded, this...
Ramaswamy Ramanujam, S. P. Suresh