Sciweavers

317 search results - page 57 / 64
» Certificateless Public Key Cryptography
Sort
View
ARESEC
2011
117views more  ARESEC 2011»
12 years 10 months ago
Non-Parallelizable and Non-Interactive Client Puzzles from Modular Square Roots
—Denial of Service (DoS) attacks aiming to exhaust the resources of a server by overwhelming it with bogus requests have become a serious threat. Especially protocols that rely o...
Yves Igor Jerschow, Martin Mauve
PKC
2012
Springer
235views Cryptology» more  PKC 2012»
12 years 10 days ago
Improved Security for Linearly Homomorphic Signatures: A Generic Framework
ded abstract of this work will appear in Public Key Cryptography — PKC 2012. This is the full version. We propose a general framework that converts (ordinary) signature schemes ...
David Mandell Freeman
EUROCRYPT
2009
Springer
14 years 10 months ago
Cube Attacks on Tweakable Black Box Polynomials
Almost any cryptographic scheme can be described by tweakable polynomials over GF(2), which contain both secret variables (e.g., key bits) and public variables (e.g., plaintext bit...
Itai Dinur, Adi Shamir
STORAGESS
2005
ACM
14 years 3 months ago
Secure capabilities for a petabyte-scale object-based distributed file system
Recently, the Network-Attached Secure Disk (NASD) model has become a more widely used technique for constructing large-scale storage systems. However, the security system proposed...
Christopher Olson, Ethan L. Miller
ASIACRYPT
2001
Springer
14 years 1 months ago
Efficient Zero-Knowledge Authentication Based on a Linear Algebra Problem MinRank
A Zero-knowledge protocol provides provably secure entity authentication based on a hard computational problem. Among many schemes proposed since 1984, the most practical rely on f...
Nicolas Courtois