Sciweavers

3504 search results - page 225 / 701
» Secure protocol composition
Sort
View
VOTEID
2007
Springer
16 years 17 days ago
Simulation-Based Analysis of E2E Voting Systems
Abstract. End-to-end auditable voting systems are expected to guarantee very interesting, and often sophisticated security properties, including correctness, privacy, fairness, rec...
Olivier de Marneffe, Olivier Pereira, Jean-Jacques...
CTRSA
2008
Springer
111views Cryptology» more  CTRSA 2008»
15 years 8 months ago
Efficient Fully-Simulatable Oblivious Transfer
Oblivious transfer, first introduced by Rabin, is one of the basic building blocks of cryptographic protocols. In an oblivious transfer (or more exactly, in its 1-out-of-2 variant...
Andrew Y. Lindell
CRYPTO
2007
Springer
133views Cryptology» more  CRYPTO 2007»
16 years 19 days ago
On Secure Multi-party Computation in Black-Box Groups
Abstract. We study the natural problem of secure n-party computation (in the passive, computationally unbounded attack model) of the n-product function fG(x1, . . . , xn) = x1 · x...
Yvo Desmedt, Josef Pieprzyk, Ron Steinfeld, Huaxio...
SPAA
2010
ACM
15 years 11 months ago
Securing every bit: authenticated broadcast in radio networks
This paper studies non-cryptographic authenticated broadcast in radio networks subject to malicious failures. We introduce two protocols that address this problem. The first, Nei...
Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Zark...
ACISP
2007
Springer
15 years 10 months ago
On Proactive Perfectly Secure Message Transmission
This paper studies the interplay of network connectivity and perfectly secure message transmission under the corrupting influence of a Byzantine mobile adversary that may move from...
Kannan Srinathan, Prasad Raghavendra, C. Pandu Ran...