Sciweavers

1612 search results - page 188 / 323
» About models of security protocols
Sort
View
EUROCRYPT
2005
Springer
15 years 3 months ago
Approximate Quantum Error-Correcting Codes and Secret Sharing Schemes
It is a standard result in the theory of quantum error-correcting codes that no code of length n can fix more than n/4 arbitrary errors, regardless of the dimension of the coding ...
Claude Crépeau, Daniel Gottesman, Adam Smit...
SIGIR
2002
ACM
14 years 9 months ago
Collaborative filtering with privacy via factor analysis
Collaborative filtering (CF) is valuable in e-commerce, and for direct recommendations for music, movies, news etc. But today's systems have several disadvantages, including ...
John F. Canny
87
Voted
ICDCS
2009
IEEE
15 years 7 months ago
Protecting Neighbor Discovery Against Node Compromises in Sensor Networks
The neighborhood information has been frequently used by protocols such as routing in sensor networks. Many methods have been proposed to protect such information in hostile envir...
Donggang Liu
INFOCOM
2007
IEEE
15 years 4 months ago
Scalable Secure Bidirectional Group Communication
— Many network applications are based on a group communications model where one party sends messages to a large number of authorized recipients and/or receives messages from mult...
Yitao Duan, John F. Canny
ESORICS
2003
Springer
15 years 3 months ago
Symmetric Authentication within a Simulatable Cryptographic Library
Abstract. Proofs of security protocols typically employ simple abstractions of cryptographic operations, so that large parts of such proofs pendent of cryptographic details. The ty...
Michael Backes, Birgit Pfitzmann, Michael Waidner