Sciweavers

1466 search results - page 93 / 294
» Completeness of the Authentication Tests
Sort
View
ITC
1998
IEEE
114views Hardware» more  ITC 1998»
14 years 13 days ago
BETSY: synthesizing circuits for a specified BIST environment
This paper presents a logic synthesis tool called BETSY (BIST Environment Testable Synthesis) for synthesizing circuits that achieve complete (100%)fault coverage in a user specif...
Zhe Zhao, Bahram Pouya, Nur A. Touba
PKC
2009
Springer
126views Cryptology» more  PKC 2009»
14 years 8 months ago
Signing a Linear Subspace: Signature Schemes for Network Coding
Network coding offers increased throughput and improved robustness to random faults in completely decentralized networks. In contrast to traditional routing schemes, however, netw...
Dan Boneh, David Freeman, Jonathan Katz, Brent Wat...
VLDB
2007
ACM
115views Database» more  VLDB 2007»
14 years 8 months ago
NS2: Networked Searchable Store with Correctness
In an outsourced data framework, we introduce and demonstrate mechanisms for securely storing a set of data items (documents) on an un-trusted server, while allowing for subsequen...
Radu Sion, Sumeet Bajaj, Bogdan Carbunar, Stefan K...
PADL
2010
Springer
14 years 5 months ago
An ER-Based Framework for Declarative Web Programming
This paper describes a framework to support the implementation of web-based systems to manipulate data stored in relational databases. Since the conceptual model of a relational da...
Michael Hanus, Sven Koschnicke
CCS
2009
ACM
14 years 3 months ago
Attacking cryptographic schemes based on "perturbation polynomials"
We show attacks on several cryptographic schemes that have recently been proposed for achieving various security goals in sensor networks. Roughly speaking, these schemes all use ...
Martin Albrecht, Craig Gentry, Shai Halevi, Jonath...