Sciweavers

67 search results - page 11 / 14
» Strengthened Security for Blind Signatures
Sort
View
CRYPTO
2007
Springer
162views Cryptology» more  CRYPTO 2007»
14 years 4 months ago
Universally-Composable Two-Party Computation in Two Rounds
Round complexity is a central measure of efficiency, and characterizing the round complexity of various cryptographic tasks is of both theoretical and practical importance. We show...
Omer Horvitz, Jonathan Katz
EUROCRYPT
2007
Springer
14 years 4 months ago
Simulatable Adaptive Oblivious Transfer
We study an adaptive variant of oblivious transfer in which a sender has N messages, of which a receiver can adaptively choose to receive k one-after-the-other, in such a way that ...
Jan Camenisch, Gregory Neven, Abhi Shelat
IACR
2011
173views more  IACR 2011»
12 years 9 months ago
All-But-Many Lossy Trapdoor Functions
We put forward a generalization of lossy trapdoor functions (LTFs). Namely, all-but-many lossy trapdoor functions (ABM-LTFs) are LTFs that are parametrized with tags. Each tag can...
Dennis Hofheinz
JOC
2008
86views more  JOC 2008»
13 years 9 months ago
Lower Bounds and Impossibility Results for Concurrent Self Composition
In the setting of concurrent self composition, a single protocol is executed many times concurrently by a single set of parties. In this paper, we prove lower bounds and impossibi...
Yehuda Lindell
MASS
2010
156views Communications» more  MASS 2010»
13 years 7 months ago
On application of Host Identity Protocol in wireless sensor networks
Recent advances in development of low-cost wireless sensor platforms open up opportunities for novel wireless sensor network (WSN) applications. Likewise emerge security concerns o...
Andrey Khurri, Dmitriy Kuptsov, Andrei Gurtov