Sciweavers

204 search results - page 12 / 41
» On Provably Secure Time-Stamping Schemes
Sort
View
ASIACRYPT
2001
Springer
14 years 10 days ago
Adaptive Security in the Threshold Setting: From Cryptosystems to Signature Schemes
Threshold cryptosystems and signature schemes give ways to distribute trust throughout a group and increase the availability of cryptographic systems. A standard approach in design...
Anna Lysyanskaya, Chris Peikert
ASIACRYPT
2000
Springer
14 years 5 days ago
From Fixed-Length to Arbitrary-Length RSA Padding Schemes
A common practice for signing with RSA is to first apply a hash function or a redundancy function to the message, add some padding and exponentiate the resulting padded message us...
Jean-Sébastien Coron, François Koeun...
CCS
2009
ACM
14 years 2 months ago
Dynamic provable data possession
As storage-outsourcing services and resource-sharing networks have become popular, the problem of efficiently proving the integrity of data stored at untrusted servers has receiv...
C. Christopher Erway, Alptekin Küpç&uu...
CRYPTO
2001
Springer
106views Cryptology» more  CRYPTO 2001»
14 years 10 days ago
Forward-Secure Signatures with Optimal Signing and Verifying
We propose the first forward-secure signature scheme for which both signing and verifying are as efficient as for one of the most efficient ordinary signature schemes (Guillou-Qui...
Gene Itkis, Leonid Reyzin
PKC
2012
Springer
212views Cryptology» more  PKC 2012»
11 years 10 months ago
Public-Key Cryptography from New Multivariate Quadratic Assumptions
In this work, we study a new multivariate quadratic (MQ) assumption that can be used to construct public-key encryption schemes. In particular, we research in the following two di...
Yun-Ju Huang, Feng-Hao Liu, Bo-Yin Yang