Sciweavers

54 search results - page 2 / 11
» Efficient Protocols for Set Membership and Range Proofs
Sort
View
IACR
2011
124views more  IACR 2011»
12 years 5 months ago
Efficient Multicast Key Distribution Using HOWF-based Access Control Structures
— Both broadcast encryption (BE) protocols and multicast key distribution (MKD) protocols try to solve the same problem of private group communication. For the first time, we dis...
Jing Liu, Qiong Huang, Bo Yang
COMPGEOM
2007
ACM
13 years 9 months ago
Guard placement for efficient point-in-polygon proofs
We consider the problem of placing a small number of angle guards inside a simple polygon P so as to provide efficient proofs that any given point is inside P. Each angle guard vi...
David Eppstein, Michael T. Goodrich, Nodari Sitchi...
EUROCRYPT
2009
Springer
14 years 6 months ago
On the Portability of Generalized Schnorr Proofs
The notion of Zero Knowledge Proofs (of knowledge) [ZKP] is central to cryptography; it provides a set of security properties that proved indispensable in concrete protocol design...
Jan Camenisch, Aggelos Kiayias, Moti Yung
CANS
2006
Springer
83views Cryptology» more  CANS 2006»
13 years 9 months ago
Efficient Mutual Data Authentication Using Manually Authenticated Strings
Abstract. Solutions for an easy and secure setup of a wireless connection between two devices are urgently needed for WLAN, Wireless USB, Bluetooth and similar standards for short ...
Sven Laur, Kaisa Nyberg
ASIACRYPT
2010
Springer
13 years 3 months ago
Linear-Complexity Private Set Intersection Protocols Secure in Malicious Model
Private Set Intersection (PSI) protocols allow one party ("client") to compute an intersection of its input set with that of another party ("server"), such tha...
Emiliano De Cristofaro, Jihye Kim, Gene Tsudik