Sciweavers

187 search results - page 4 / 38
» On Garbling Schemes With And Without Privacy
Sort
View
CCS
2006
ACM
15 years 1 months ago
Virtual monotonic counters and count-limited objects using a TPM without a trusted OS
A trusted monotonic counter is a valuable primitive that enables a wide variety of highly scalable offline and decentralized applications that would otherwise be prone to replay a...
Luis F. G. Sarmenta, Marten van Dijk, Charles W. O...
CORR
2008
Springer
166views Education» more  CORR 2008»
14 years 9 months ago
Information-Theoretically Secure Voting Without an Honest Majority
We present three voting protocols with unconditional privacy and information-theoretic correctness, without assuming any bound on the number of corrupt voters or voting authorities...
Anne Broadbent, Alain Tapp
PVLDB
2010
143views more  PVLDB 2010»
14 years 8 months ago
Embellishing Text Search Queries To Protect User Privacy
Users of text search engines are increasingly wary that their activities may disclose confidential information about their business or personal profiles. It would be desirable f...
HweeHwa Pang, Xuhua Ding, Xiaokui Xiao
CSFW
2009
IEEE
15 years 1 months ago
Authentication without Elision: Partially Specified Protocols, Associated Data, and Cryptographic Models Described by Code
Specification documents for real-world authentication protocols typically mandate some aspects of a protocol's behavior but leave other features optional or undefined. In add...
Phillip Rogaway, Till Stegers
ACMICEC
2004
ACM
148views ECommerce» more  ACMICEC 2004»
15 years 3 months ago
A secure and private clarke tax voting protocol without trusted authorities
Electronic voting has become one of the most popular activities over the Internet. Security and privacy are always regarded as crucial factors in electronic voting system design. ...
Changjie Wang, Ho-fung Leung