Sciweavers

326 search results - page 18 / 66
» Digital Signature Scheme Based on a New Hard Problem
Sort
View
CSFW
2008
IEEE
14 years 2 months ago
Joint State Theorems for Public-Key Encryption and Digital Signature Functionalities with Local Computation
Composition theorems in simulation-based approaches allow to build complex protocols from sub-protocols in a modular way. However, as first pointed out and studied by Canetti and ...
Ralf Küsters, Max Tuengerthal
STACS
2009
Springer
14 years 2 months ago
Generating Shorter Bases for Hard Random Lattices
We revisit the problem of generating a “hard” random lattice together with a basis of relatively short vectors. This problem has gained in importance lately due to new cryptogr...
Joël Alwen, Chris Peikert
CCS
2003
ACM
14 years 24 days ago
On the performance, feasibility, and use of forward-secure signatures
Forward-secure signatures (FSSs) have recently received much attention from the cryptographic theory community as a potentially realistic way to mitigate many of the difficulties...
Eric Cronin, Sugih Jamin, Tal Malkin, Patrick Drew...
CRYPTO
2003
Springer
132views Cryptology» more  CRYPTO 2003»
14 years 24 days ago
On Cryptographic Assumptions and Challenges
We deal with computational assumptions needed in order to design secure cryptographic schemes. We suggest a classi£cation of such assumptions based on the complexity of falsifying...
Moni Naor
FC
2007
Springer
158views Cryptology» more  FC 2007»
14 years 1 months ago
Hidden Identity-Based Signatures
This paper introduces Hidden Identity-based Signatures (Hidden-IBS), a type of digital signatures that provide mediated signer-anonymity on top of Shamir’s Identity-based signat...
Aggelos Kiayias, Hong-Sheng Zhou