915 search results - page 142 / 183 » Proof labeling schemes |
GLOBECOM
2007
IEEE
15 years 5 months ago
2007
IEEE
—In [1], the author introduced a strategy to use network coding on p-Cycles in order to provide 1+N protection for straddling connections and links against single link failures i...
DAGSTUHL
2007
15 years 17 days ago
2007
Local tag structures have become frequent through Web 2.0: Users "tag" their data without specifying the underlying semantics. Every user annotates items in an individual...
CCS
2001
ACM
15 years 2 months ago
2001
ACM
We present a mathematical construct which provides a cryptographic protocol to verifiably shuffle a sequence of k modular integers, and discuss its application to secure, universa...
187
click to vote
EUROPKI
2009
Springer
14 years 9 months ago
2009
Springer
Efficient zero-knowledge proofs of knowledge (ZK-PoK) are basic building blocks of many cryptographic applications such as identification schemes, group signatures, and secure mult...
106
click to vote
ESORICS
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. Several generic constructions for transforming one-way functions to asymmetric encryption schemes have been proposed. One-way functions only guarantee the weak secrecy of...