546 search results - page 29 / 110 » On the Power of Secure Two-Party Computation |
FOSSACS
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. Using a probabilistic polynomial-time process calculus designed for specifying security properties as observational equivalences, we develop a form of bisimulation that j...
ESORICS
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. We present a framework for modeling adversaries in security protocol analysis, ranging from a Dolev-Yao style adversary to more powerful adversaries who can reveal differ...
ISCC
2007
IEEE
15 years 4 months ago
2007
IEEE
Even though PDAs in general—but smartcards in particular—can be trusted to keep secrets, because they have meager resources, including them in security protocols is difficult...
EUROCRYPT
2008
Springer
14 years 11 months ago
2008
Springer
In the model of perfectly secure message transmission schemes (PSMTs), there are n channels between a sender and a receiver. An infinitely powerful adversary A may corrupt (observe...
PET
2004
Springer
15 years 3 months ago
2004
Springer
Internet computing technologies, like grid computing, enable a weak computational device connected to such a grid to be less limited by its inadequate local computational, storage,...