Sciweavers

954 search results - page 105 / 191
» On the Security of ''Golden'' Cryptography
Sort
View
ACNS
2005
Springer
85views Cryptology» more  ACNS 2005»
15 years 3 months ago
New Signature Schemes with Coupons and Tight Reduction
Amongst provably secure signature schemes, two distinct classes are of particular interest: the ones with tight reduction (e.g., RSA-PSS), and those which support the use of coupon...
Benoît Chevallier-Mames
PKC
2005
Springer
110views Cryptology» more  PKC 2005»
15 years 3 months ago
From Fixed-Length to Arbitrary-Length RSA Encoding Schemes Revisited
To sign with RSA, one usually encodes the message m as µ(m) and then raises the result to the private exponent modulo N. In Asiacrypt 2000, Coron et al. showed how to build a secu...
Julien Cathalo, Jean-Sébastien Coron, David...
CCS
2003
ACM
15 years 3 months ago
Establishing pairwise keys in distributed sensor networks
Pairwise key establishment is a fundamental security service in sensor networks; it enables sensor nodes to communicate securely with each other using cryptographic techniques. Ho...
Donggang Liu, Peng Ning
CSFW
2010
IEEE
15 years 1 months ago
A Machine-Checked Formalization of Sigma-Protocols
—Zero-knowledge proofs have a vast applicability in the domain of cryptography, stemming from the fact that they can be used to force potentially malicious parties to abide by th...
Gilles Barthe, Daniel Hedin, Santiago Zanella B&ea...
ECOWS
2007
Springer
14 years 11 months ago
SSL-over-SOAP: Towards a Token-based Key Establishment Framework for Web Services
Key establishment is essential for many applications of cryptography. Its purpose is to negotiate keys for other cryptographic schemes, usually for encryption and authentication. I...
Sebastian Gajek, Lijun Liao, Bodo Möller, J&o...