Sciweavers

3115 search results - page 458 / 623
» Synthesizing Secure Protocols
Sort
View
PKC
2010
Springer
148views Cryptology» more  PKC 2010»
15 years 10 months ago
On the Feasibility of Consistent Computations
In many practical settings, participants are willing to deviate from the protocol only if they remain undetected. Aumann and Lindell introduced a concept of covert adversaries to f...
Sven Laur, Helger Lipmaa
ACNS
2006
Springer
138views Cryptology» more  ACNS 2006»
15 years 9 months ago
Syntax-Driven Private Evaluation of Quantified Membership Queries
Abstract. Membership queries are basic predicate operations that apply to datasets. Quantifications of such queries express global properties between datasets, including subset inc...
Aggelos Kiayias, Antonina Mitrofanova
CRYPTO
2006
Springer
112views Cryptology» more  CRYPTO 2006»
15 years 9 months ago
Receipt-Free Universally-Verifiable Voting with Everlasting Privacy
We present the first universally verifiable voting scheme that can be based on a general assumption (existence of a non-interactive commitment scheme). Our scheme is also the first...
Tal Moran, Moni Naor
PDPTA
2008
15 years 7 months ago
Intrusion-Tolerant Dissemination in Large-Scale Systems
Abstract - With the growth of the Internet and increased demand for Web Services has come a heightened need for scalable wide-area group communication systems. The need for trust i...
Kim Potter Kihlstrom, Robin Elliott, Kelsey Marshm...
CRYPTO
2010
Springer
158views Cryptology» more  CRYPTO 2010»
15 years 7 months ago
Interactive Locking, Zero-Knowledge PCPs, and Unconditional Cryptography
Motivated by the question of basing cryptographic protocols on stateless tamper-proof hardware tokens, we revisit the question of unconditional two-prover zero-knowledge proofs fo...
Vipul Goyal, Yuval Ishai, Mohammad Mahmoody, Amit ...