Sciweavers

849 search results - page 10 / 170
» Completely Non-malleable Schemes
Sort
View
CASES
2009
ACM
14 years 12 days ago
Complete nanowire crossbar framework optimized for the multi-spacer patterning technique
Nanowire crossbar circuits are an emerging architectural paradigm that promises a higher integration density and an improved fault-tolerance due to its reconfigurability. In this...
M. Haykel Ben Jamaa, Gianfranco Cerofolini, Yusuf ...
LREC
2008
141views Education» more  LREC 2008»
13 years 9 months ago
All, and only, the Errors: more Complete and Consistent Spelling and OCR-Error Correction Evaluation
Some time in the future, some spelling error correction system will correct all the errors, and only the errors. We need evaluation metrics that will tell us when this has been ac...
Martin Reynaert
MAGS
2006
79views more  MAGS 2006»
13 years 7 months ago
Utilizing node's selfishness for providing complete anonymity in peer-to-peer based grids
In this paper, a novel protocol for providing both client and server anonymity in peer-to-peer (P2P) based grids is presented. The protocol assumes individual nodes or users to be...
Rohit Gupta, Souvik Ray, Arun K. Somani, Zhao Zhan...
SCN
2008
Springer
128views Communications» more  SCN 2008»
13 years 7 months ago
On Linear Secret Sharing for Connectivity in Directed Graphs
In this work we study linear secret sharing schemes for s-t connectivity in directed graphs. In such schemes the parties are edges of a complete directed graph, and a set of partie...
Amos Beimel, Anat Paskin
COMSWARE
2008
IEEE
14 years 2 months ago
Deterministic schemes for key distribution in wireless sensor networks
— In this paper, we propose a new security metric for measuring resilience of a symmetric key distribution scheme in wireless sensor network. A polynomial-based and a novel compl...
Abhishek Gupta, Joy Kuri