Sciweavers

361 search results - page 61 / 73
» Composition of Password-Based Protocols
Sort
View
CONCUR
2010
Springer
13 years 7 months ago
Conditional Automata: A Tool for Safe Removal of Negligible Events
Abstract. Polynomially accurate simulations [19] are relations for Probabilistic Automata that require transitions to be matched up to negligible sets provided that computation len...
Roberto Segala, Andrea Turrini
POPL
2012
ACM
12 years 3 months ago
A compiler and run-time system for network programming languages
Software-defined networks (SDNs) are a new implementation architecture in which a controller machine manages a distributed collection of switches, by instructing them to install ...
Christopher Monsanto, Nate Foster, Rob Harrison, D...
INFOCOM
2009
IEEE
14 years 2 months ago
Encounter-Based Routing in DTNs
—Current work in routing protocols for delay and disruption tolerant networks leverage epidemic-style algorithms that trade off injecting many copies of messages into the network...
Samuel C. Nelson, Mehedi Bakht, Robin Kravets
CRYPTO
2007
Springer
162views Cryptology» more  CRYPTO 2007»
14 years 1 months ago
Universally-Composable Two-Party Computation in Two Rounds
Round complexity is a central measure of efficiency, and characterizing the round complexity of various cryptographic tasks is of both theoretical and practical importance. We show...
Omer Horvitz, Jonathan Katz
CSFW
2006
IEEE
14 years 1 months ago
Simulation-Based Security with Inexhaustible Interactive Turing Machines
Recently, there has been much interest in extending models for simulation-based security in such a way that the runtime of protocols may depend on the length of their input. Findi...
Ralf Küsters