Sciweavers

2601 search results - page 213 / 521
» Secure Rewarding Schemes
Sort
View
195
Voted
EDBT
2010
ACM
138views Database» more  EDBT 2010»
15 years 11 months ago
How to authenticate graphs without leaking
Secure data sharing in multi-party environments requires that both authenticity and confidentiality of the data be assured. Digital signature schemes are commonly employed for au...
Ashish Kundu, Elisa Bertino
ICISC
2004
147views Cryptology» more  ICISC 2004»
15 years 8 months ago
Batch Verifications with ID-Based Signatures
An identity (ID)-based signature scheme allows any pair of users to verify each other's signatures without exchanging public key certificates. With the advent of Bilinear maps...
HyoJin Yoon, Jung Hee Cheon, Yongdae Kim
158
Voted
IACR
2011
84views more  IACR 2011»
14 years 6 months ago
Tools for Simulating Features of Composite Order Bilinear Groups in the Prime Order Setting
In this paper, we explore a general methodology for converting composite order pairingbased cryptosystems into the prime order setting. We employ the dual pairing vector space app...
Allison B. Lewko
IACR
2011
137views more  IACR 2011»
14 years 6 months ago
Lightweight Anonymous Authentication with TLS and DAA for Embedded Mobile Devices
Although anonymous authentication has been extensively studied, so far no scheme has been widely adopted in practice. A particular issue with fully anonymous authentication schemes...
Liqun Chen, Kurt Dietrich, Hans Löhr, Ahmad-R...
TCC
2007
Springer
86views Cryptology» more  TCC 2007»
16 years 24 days ago
Weakly-Private Secret Sharing Schemes
Abstract. Secret-sharing schemes are an important tool in cryptography that is used in the construction of many secure protocols. However, the shares’ size in the best known secr...
Amos Beimel, Matthew K. Franklin