Sciweavers

237 search results - page 38 / 48
» On the decidability and complexity of reasoning about only k...
Sort
View
CONEXT
2009
ACM
13 years 9 months ago
Macroscope: end-point approach to networked application dependency discovery
Enterprise and data center networks consist of a large number of complex networked applications and services that depend upon each other. For this reason, they are difficult to ma...
Lucian Popa 0002, Byung-Gon Chun, Ion Stoica, Jaid...
JOC
2007
93views more  JOC 2007»
13 years 8 months ago
Robust Information-Theoretic Private Information Retrieval
A Private Information Retrieval (PIR) protocol allows a user to retrieve a data item of its choice from a database, such that the servers storing the database do not gain informat...
Amos Beimel, Yoav Stahl
CRYPTO
2009
Springer
150views Cryptology» more  CRYPTO 2009»
14 years 3 months ago
Short and Stateless Signatures from the RSA Assumption
We present the first signature scheme which is “short”, stateless and secure under the RSA assumption in the standard model. Prior short, standard model signatures in the RSA...
Susan Hohenberger, Brent Waters
FC
2007
Springer
125views Cryptology» more  FC 2007»
14 years 2 months ago
Scalable Authenticated Tree Based Group Key Exchange for Ad-Hoc Groups
Task-specific groups are often formed in an ad-hoc manner within big structures, like companies. Take the following typical scenario: A high rank manager decides that a task force...
Yvo Desmedt, Tanja Lange, Mike Burmester
LATA
2010
Springer
14 years 15 days ago
Variable Automata over Infinite Alphabets
Automated reasoning about systems with infinite domains requires an extension of regular automata to infinite alphabets. Existing formalisms of such automata cope with the infinite...
Sarai Sheinvald, Orna Grumberg, Orna Kupferman