Sciweavers

26 search results - page 5 / 6
» Forgery of Provable Secure Short Signcryption Scheme
Sort
View
CTRSA
2007
Springer
146views Cryptology» more  CTRSA 2007»
15 years 3 months ago
How to Strengthen Any Weakly Unforgeable Signature into a Strongly Unforgeable Signature
Standard signature schemes are usually designed only to achieve weak unforgeability – i.e. preventing forgery of signatures on new messages not previously signed. However, most s...
Ron Steinfeld, Josef Pieprzyk, Huaxiong Wang
ASIACRYPT
2000
Springer
15 years 1 months ago
A Length-Invariant Hybrid Mix
This paper presents a secure and flexible Mix-net that has the following properties; it efficiently handles long plaintexts that exceed the modulus size of underlying public-key e...
Miyako Ohkubo, Masayuki Abe
83
Voted
CCS
2007
ACM
15 years 3 months ago
Security under key-dependent inputs
In this work we re-visit the question of building cryptographic primitives that remain secure even when queried on inputs that depend on the secret key. This was investigated by B...
Shai Halevi, Hugo Krawczyk
CTRSA
2005
Springer
221views Cryptology» more  CTRSA 2005»
15 years 3 months ago
Accumulators from Bilinear Pairings and Applications
We propose a dynamic accumulator scheme from bilinear pairings, whose security is based on the Strong Diffie-Hellman assumption. We show applications of this accumulator in constru...
Lan Nguyen
ISW
2009
Springer
15 years 4 months ago
Privacy-Aware Attribute-Based Encryption with User Accountability
As a new public key primitive, attribute-based encryption (ABE) is envisioned to be a promising tool for implementing fine-grained access control. To further address the concern o...
Jin Li, Kui Ren, Bo Zhu, Zhiguo Wan