Sciweavers

241 search results - page 20 / 49
» Machine-Checked Security Proofs of Cryptographic Signature S...
Sort
View
PKC
2007
Springer
129views Cryptology» more  PKC 2007»
14 years 2 months ago
Two-Tier Signatures, Strongly Unforgeable Signatures, and Fiat-Shamir Without Random Oracles
We provide a positive result about the Fiat-Shamir (FS) transform in the standard model, showing how to use it to convert threemove identification protocols into two-tier signatur...
Mihir Bellare, Sarah Shoup
PQCRYPTO
2010
250views Cryptology» more  PQCRYPTO 2010»
14 years 16 days ago
Strongly Unforgeable Signatures and Hierarchical Identity-Based Signatures from Lattices without Random Oracles
Abstract. We propose a variant of the “bonsai tree” signature scheme, a latticebased existentially unforgeable signature scheme in the standard model. Our construction offers ...
Markus Rückert
CCS
2010
ACM
13 years 8 months ago
Computational indistinguishability logic
Computational Indistinguishability Logic (CIL) is a logic for reasoning about cryptographic primitives in computational models. It captures reasoning patterns that are common in p...
Gilles Barthe, Marion Daubignard, Bruce M. Kapron,...
CORR
2010
Springer
97views Education» more  CORR 2010»
13 years 8 months ago
Cryptanalysis of an Efficient Signcryption Scheme with Forward Secrecy Based on Elliptic Curve
The signcryption is a relatively new cryptographic technique that is supposed to fulfill the functionalities of encryption and digital signature in a single logical step. Several ...
Mohsen Toorani, Ali Asghar Beheshti Shirazi
ASIACRYPT
2000
Springer
14 years 29 days ago
A New Forward-Secure Digital Signature Scheme
nded abstract of this work appears Advances in Cryptology — Asiacrypt 2000, Tatsuaki Okamoto, editor, Lecture Notes in Computer Science vol. 1976, Springer-Verlag, 2000. c IACR A...
Michel Abdalla, Leonid Reyzin