Information Security Theory and Practice
12th IFIP WG 11.2 International Conference, WISTP 2018, Brussels, Belgium, December 10–11, 2018, Revised Selected Papers
Page
%P
-
Chapter and Conference Paper
Cryptographic Accumulators: New Definitions, Enhanced Security, and Delegatable Proofs
Cryptographic accumulators, introduced in 1993 by Benaloh and De Mare, represent a set with a concise value and offer proofs of (non-)membership. Accumulators have evolved, becoming essential in anonymous cred...
-
Chapter and Conference Paper
A Public Key Identity-Based Revocation Scheme:
Multi-Recipient Encryption allows users to send secure messages to any chosen set of registered users. In ACISP’21, Blazy et al. proposed a multi-recipient encryption with attribute-hiding revocation where cip...
-
Article
Anonymous attribute-based designated verifier signature
An attribute-based signature (ABS), is a cryptographic scheme where someone can sign a message using any kind of predicates verified by the attributes he owns. For such scheme, it is expected to be impossible ...
-
Chapter and Conference Paper
Post-quantum and UC-Secure Oblivious Transfer from SPHF with Grey Zone
Oblivious Transfer (OT) is a major primitive for secure multi-party computation. Indeed, combined with symmetric primitives along with garbled circuits, it allows any secure function evaluation between two partie...
-
Chapter and Conference Paper
Dually Computable Cryptographic Accumulators and Their Application to Attribute Based Encryption
In 1993, Benaloh and De Mare introduced cryptographic accumulator, a primitive that allows the representation of a set of values by a short object (the accumulator) and offers the possibility to prove that som...
-
Article
A gapless code-based hash proof system based on RQC and its applications
Cramer and Shoup introduced at Eurocrypt’02 the concept of hash proof system, also designated as smooth projective hash functions. Since then, they have found several applications, from building CCA-2 encrypti...
-
Chapter and Conference Paper
Identity-Based Encryption in DDH Hard Groups
The concept of Identity-Based Encryption was first introduced by Shamir (CRYPTO 1984) but were not realised until much later by Sakai, Ohgishi and Kasahara (SCIS 2000), Boneh and Franklin (CRYPTO 2001) and Coc...
-
Chapter and Conference Paper
A Rank Metric Code-Based Group Signature Scheme
Group signature is a major tool in today’s cryptography. Rank based cryptography has been known for almost 30 years and recently reached the second round of the NIST competition for post-quantum primitives. In...
-
Chapter and Conference Paper
A Correction to a Code-Based Blind Signature Scheme
This work proposes a reparation to the flaw in the paper of Blazy et al. (IEEE 2017). The flaw lies in the proof of the unforgeability property. More precisely, the way of handling collisions and of using the adv...
-
Chapter and Conference Paper
(Augmented) Broadcast Encryption from Identity Based Encryption with Wildcard
Several broadcast encryption (BE) constructions have been proposed since Fiat and Naor introduced the concept, some achieving short parameters size while others achieve better security. Since 1994, a lot of al...
-
Chapter and Conference Paper
An Anonymous Trace-and-Revoke Broadcast Encryption Scheme
Broadcast Encryption is a fundamental cryptographic primitive, that gives the ability to send a secure message to any chosen target set among registered users. In this work, we investigate broadcast encryption...
-
Chapter and Conference Paper
Generic Plaintext Equality and Inequality Proofs
Given two ciphertexts generated with a public-key encryption scheme, the problem of plaintext equality consists in determining whether the ciphertexts hold the same value. Similarly, the problem of plaintext i...
-
Chapter and Conference Paper
How to (Legally) Keep Secrets from Mobile Operators
Secure-channel establishment allows two endpoints to communicate confidentially and authentically. Since they hide all data sent across them, good or bad, secure channels are often subject to mass surveillance...
-
Article
Cryptanalysis of a rank-based signature with short public keys
Following Schnorr framework for obtaining digital signatures, Song et al. recently proposed a new instantiation of a signature scheme featuring small public keys from coding assumptions in rank metric, which w...
-
Article
New efficient M2C and M2M mutual authentication protocols for IoT-based healthcare applications
With the rapid advancement of heterogeneous wireless technologies and their proliferation in ambient connected objects, the Internet of Things (IoT) is a paradigm that revolutionizes communication between peop...
-
Chapter and Conference Paper
Skip** the q in Group Signatures
The notion of group signatures was introduced to allow group members to sign anonymously on behalf of a group. A group manager allows a user to join a group, and another will be able to open a signature to rev...
-
Chapter and Conference Paper
CCA-Secure ABE Using Tag and Pair Encoding
Jutla and Roy (Asiacrypt 2013) proposed the first tag-based identity-based encryption which Chen and Gong (Asiacrypt 2017) extended to construct CPA-secure attribute-based encryption (ABE) in prime-order group...
-
Chapter and Conference Paper
Public-Key Generation with Verifiable Randomness
We revisit the problem of proving that a user algorithm selected and correctly used a truly random seed in the generation of her cryptographic key. A first approach was proposed in 2002 by Juels and Guajardo f...
-
Book and Conference Proceedings
-
Chapter and Conference Paper
Durandal: A Rank Metric Based Signature Scheme
We describe a variation of the Schnorr-Lyubashevsky approach to devising signature schemes that is adapted to rank based cryptography. This new approach enables us to obtain a randomization of the signature, w...
