Sciweavers

127 search results - page 17 / 26
» On Cryptographic Schemes Based on Discrete Logarithms and Fa...
Sort
View
ASIACRYPT
2011
Springer
13 years 9 months ago
The Leakage-Resilience Limit of a Computational Problem Is Equal to Its Unpredictability Entropy
A cryptographic assumption is the (unproven) mathematical statement that a certain computational problem (e.g. factoring integers) is computationally hard. The leakage-resilience l...
Divesh Aggarwal, Ueli Maurer
CTRSA
2009
Springer
127views Cryptology» more  CTRSA 2009»
15 years 4 months ago
Adaptive-ID Secure Revocable Identity-Based Encryption
Abstract. Identity-Based Encryption (IBE) offers an interesting alternative to PKI-enabled encryption as it eliminates the need for digital certificates. While revocation has bee...
Benoît Libert, Damien Vergnaud
EUROCRYPT
1995
Springer
15 years 1 months ago
Verifiable Signature Sharing
Abstract. We introduce Verifiable Signature Sharing (VCS), a cryptographic primitive for protecting digital signatures. VCS enables the holder of a digitally signed document, who m...
Matthew K. Franklin, Michael K. Reiter
BIBE
2007
IEEE
110views Bioinformatics» more  BIBE 2007»
15 years 4 months ago
Discrete Methods for Association Search and Status Prediction in Genotype Case-Control Studies
Abstract—Recent improvements in high-throughput genotyping technology make possible genome-wide association studies and status prediction (classification) for common complex dis...
Dumitru Brinza, Alexander Zelikovsky
ACISP
2003
Springer
15 years 1 months ago
Digital Signature Schemes with Restriction on Signing Capability
In some practical circumstances, the ability of a signer should be restricted. In group signature schemes, a group member may be allowed to generate signatures up to a certain numb...
Jung Yeon Hwang, Hyun-Jeong Kim, Dong Hoon Lee, Jo...