Sciweavers

915 search results - page 73 / 183
» Proof labeling schemes
Sort
View
CRYPTO
2001
Springer
113views Cryptology» more  CRYPTO 2001»
14 years 15 days ago
OAEP Reconsidered
The OAEP encryption scheme was introduced by Bellare and Rogaway at Eurocrypt ’94. It converts any trapdoor permutation scheme into a public-key encryption scheme. OAEP is widel...
Victor Shoup
INFOCOM
2000
IEEE
13 years 11 months ago
Traffic Engineering Using Multiple Multipoint-to-Point LSPs
Traffic engineering aims to optimize the utilization of existing network resources for load balance and failure recovery, and these are to be accomplished in a scalable fashion. Th...
Hiroyuki Saito, Yasuhiro Miyao, Makiko Yoshida
PKC
2004
Springer
150views Cryptology» more  PKC 2004»
14 years 1 months ago
Undeniable Signatures Based on Characters: How to Sign with One Bit
We present a new undeniable signature scheme which is based on the computation of characters. Our signature scheme offers the advantage of having an arbitrarily short signature. I...
Jean Monnerat, Serge Vaudenay
ASIACRYPT
2001
Springer
14 years 15 days ago
Provably Secure Fair Blind Signatures with Tight Revocation
A fair blind signature scheme allows the trustee to revoke blindness so that it provides authenticity and anonymity to honest users while preventing malicious users from abusing th...
Masayuki Abe, Miyako Ohkubo
PAMI
2010
215views more  PAMI 2010»
13 years 6 months ago
Fusion Moves for Markov Random Field Optimization
—The efficient application of graph cuts to Markov Random Fields (MRFs) with multiple discrete or continuous labels remains an open question. In this paper, we demonstrate one p...
Victor S. Lempitsky, Carsten Rother, Stefan Roth, ...