5 research outputs found
SPDH-Sign: towards Efficient, Post-quantum Group-based Signatures
In this paper, we present a new diverse class of post-quantum group-based
Digital Signature Schemes (DSS). The approach is significantly different from
previous examples of group-based digital signatures and adopts the framework of
group action-based cryptography: we show that each finite group defines a group
action relative to the semidirect product of the group by its automorphism
group, and give security bounds on the resulting signature scheme in terms of
the group-theoretic computational problem known as the Semidirect Discrete
Logarithm Problem (SDLP). Crucially, we make progress towards being able to
efficiently compute the novel group action, and give an example of a
parameterised family of groups for which the group action can be computed for
any parameters, thereby negating the need for expensive offline computation or
inclusion of redundancy required in other schemes of this type
SPDH-Sign: towards Efficient, Post-quantum Group-based Signatures
In this paper, we present a new diverse class of post-quantum group-based Digital Signature Schemes (DSS). The approach is significantly different from previous examples of group-based digital signatures and adopts the framework of group action-based cryptography: we show that each finite group defines a group action relative to the semidirect product of the group by its automorphism group, and give security bounds on the resulting signature scheme in terms of the group-theoretic computational problem known as the Semidirect Discrete Logarithm Problem (SDLP). Crucially, we make progress towards being able to efficiently compute the novel group action, and give an example of a parameterised family of groups for which the group action can be computed for any parameters, thereby negating the need for expensive offline computation or inclusion of redundancy required in other schemes of this type
Anonymous Point Collection - Improved Models and Security Definitions
This work is a comprehensive, formal treatment of anonymous point collection. The proposed definition does not only provide a strong notion of security and privacy, but also covers features which are important for practical use. An efficient realization is presented and proven to fulfill the proposed definition. The resulting building block is the first one that allows for anonymous two-way transactions, has semi-offline capabilities, yields constant storage size, and is provably secure
Anonymous Point Collection - Improved Models and Security Definitions
This work is a comprehensive, formal treatment of anonymous point collection. The proposed definition does not only provide a strong notion of security and privacy, but also covers features which are important for practical use. An efficient realization is presented and proven to fulfill the proposed definition. The resulting building block is the first one that allows for anonymous two-way transactions, has semi-offline capabilities, yields constant storage size, and is provably secure