Share This Author
Divisible E-Cash Systems Can Be Truly Anonymous
This paper presents an off-line divisible e-cash scheme where a user can withdraw a divisible coin of monetary value 2Lthat he can parceled and spend anonymously and unlinkably. We present the…
BlindIDS: Market-Compliant and Privacy-Friendly Intrusion Detection System over Encrypted Traffic
- Sébastien Canard, Aïda Diop, Nizar Kheir, Marie Paindavoine, M. Sabt
- Computer ScienceAsiaCCS
- 2 April 2017
This paper presents a novel approach that makes possible to perform DPI directly on encrypted traffic, without knowing neither the traffic content, nor the patterns of detection signatures, which preserves the delicate balance in the security market ecosystem.
On Extended Sanitizable Signature Schemes
A new secure sanitizable signature scheme is given which is, to the best of the knowledge, the most efficient construction with such a high level of security.
- Sébastien Canard, Georg Fuchsbauer, A. Gouget, Fabien Laguillaumie
- Computer Science, MathematicsCT-RSA
- 27 February 2012
A new cryptographic primitive is defined called plaintext-checkable encryption (PCE), which extends public-key encryption by the following functionality: given a plaintext, a ciphertext and a public key, it is universally possible to check whether the ciphertext encrypts the plaintext under the key.
Multiple Denominations in E-cash with Compact Transaction Data
This work presents a new construction of divisible e-cash that makes use of a new generation method of the binary tree of keys, and proposes the first strongly anonymous scheme with standard unforgeability requirement and realistic generation parameters while improving the efficiency of the spending phase.
Protecting privacy by sanitizing personal data: a new approach to anonymous credentials
existing sanitizable signatures are sought for generic conditions on them to be used as anonymous credentials and a concrete construction based on standard assumptions and secure in the random oracle model is provided.
On Fair E-cash Systems Based on Group Signature Schemes
This paper presents a secure and efficient fair e-cash system based on a group signature scheme that ensures traceability of double-spenders, supports coin tracing and provides coins that are unforgeable and anonymous under standard assumptions.
TrapdoorSanitizable Signatures and Their Application to Content Protection
This paper formally introduces trapdoor sanitizable signatures, a concept that allows a designated entity to modify some specific parts of a signed message and to produce a new signature of the resulting message without any interaction with the original signer.
A Handy Multi-coupon System
A formal security model for coupon systems is proposed and a practical multi-coupon system with new features is designed: the quantity of single coupons in a multi-Coupon is not defined by the system and the value of each coupon is chosen in a predefined set of values.
Delegating a Pairing Can Be Both Secure and Efficient
Bilinear pairings have been widely used in cryptographic protocols since they provide very interesting functionalities in regard of identity based cryptography, short signatures or cryptographic tools with complex properties, but their implementation on limited devices remains complex and the current results in terms of computational complexity may still be prohibitive.