Sciweavers

179 search results - page 29 / 36
» On the Security of Some Proxy Blind Signature Schemes
Sort
View
EUROCRYPT
2007
Springer
14 years 1 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
DRM
2003
Springer
14 years 22 days ago
Breaking and repairing optimistic fair exchange from PODC 2003
In PODC 2003, Park, Chong, Siegel and Ray [22] proposed an optimistic protocol for fair exchange, based on RSA signatures. We show that their protocol is totally breakable already...
Yevgeniy Dodis, Leonid Reyzin
DASFAA
2006
IEEE
134views Database» more  DASFAA 2006»
14 years 1 months ago
Authentication of Outsourced Databases Using Signature Aggregation and Chaining
Database outsourcing is an important emerging trend which involves data owners delegating their data management needs to an external service provider. Since a service provider is a...
Maithili Narasimha, Gene Tsudik
ASIACRYPT
2003
Springer
14 years 22 days ago
Generalized Powering Functions and Their Application to Digital Signatures
This paper investigates some modular powering functions suitable for cryptography. It is well known that the Rabin encryption function is a 4-to-1 mapping and breaking its one-wayn...
Hisayoshi Sato, Tsuyoshi Takagi, Satoru Tezuka, Ka...
ASIACRYPT
1999
Springer
13 years 11 months ago
How to Prove That a Committed Number Is Prime
Abstract. The problem of proving a number is of a given arithmetic format with some prime elements, is raised in RSA undeniable signature, group signature and many other cryptograp...
Tri Van Le, Khanh Quoc Nguyen, Vijay Varadharajan