Sciweavers

5119 search results - page 177 / 1024
» Security Privacy
Sort
View
CCS
2001
ACM
15 years 8 months ago
Constraint solving for bounded-process cryptographic protocol analysis
The reachability problem for cryptographic protocols with nonatomic keys can be solved via a simple constraint satisfaction procedure.
Jonathan K. Millen, Vitaly Shmatikov
156
Voted
AGENTS
1997
Springer
15 years 8 months ago
Fusing Autonomy and Sociability in Robots
Quoting somerobotic examples, I willlist some key issues in fusing autonomy and sociability: tools and control architecture, attention, behavior matching, embodiment, similarity, ...
Yasuo Kuniyoshi
CCS
2009
ACM
15 years 8 months ago
Efficient pseudorandom functions from the decisional linear assumption and weaker variants
In this paper, we generalize Naor and Reingold's construction of pseudorandom functions under the DDH Assumption to yield a construction of pseudorandom
Allison B. Lewko, Brent Waters
108
Voted
SP
2010
IEEE
149views Security Privacy» more  SP 2010»
15 years 8 months ago
On the Incoherencies in Web Browser Access Control Policies
—Web browsers’ access control policies have evolved
Kapil Singh, Alexander Moshchuk, Helen J. Wang, We...
FOSAD
2009
Springer
15 years 8 months ago
Certified Static Analysis by Abstract Interpretation
d Static Analysis by Abstract Interpretation Fr
Frédéric Besson, David Cachera, Thom...