There have been several approaches in the past to obtain signature schemes with appendix and signature schemes giving message recovery based on the discrete logarithm problem. Most of them can be embedded into a Meta-ElGamal and Meta-Message recovery scheme. In this paper we present the Meta-blind signature schemes which have been developed from the ElGamal based blind signature scheme and the ...

Digital platform technology enables circular business models that facilitate the reduction, reuse, and recycling of resources materials across large ecosystems actors. However, little is currently known about inner workings such platforms how they are organized. Framing these as meta-organizations, this study examines orchestration mechanisms deployed by owners to economic value creation with a...

Meta-typing, as for example employed in the Progres environment , is syntactic sugar making the speciication of typed graph grammar systems more convenient. This paper presents an approach of meta-typing that ts in the well-elaborated framework of the typed single pushout (spo) approach to graph transformation. In a rst step the node meta-typing system of Progres is generalized such that edges ...

Inspired by our exploration of the applicability of automated question answering (QA) technology to the task of business intelligence and general design science principle, we advocate a meta approach to the QA (fact seeking) applications since it does not rely on a single system and may provide the necessary accuracy and responsiveness. We present our prototype of a fact seeking meta engine, th...

The concept of timed-released encryption with pre-open capability (TRE-PC) was introduced by Hwang, Yum and Lee. In a TREPC scheme, a message is encrypted in such a way that it can only be decrypted at a certain point in time or if the sender releases a piece of trapdoor information known as a pre-open key. This paper examines the security model for a TRE-PC scheme, demonstrates that a TRE-PC s...

This paper analyzes the security of amplitude encoding for double random phase encryption. We describe several types of attack. The system is found to be resistant to brute-force attacks but vulnerable to chosen and known plaintext attacks.

In this paper we describe the main ideas of a few versions of an algebraic known plaintext attack against AES-128. The attack could be applied under the hypothesis of knowing a part of the 16-bytes key. These attack versions are based on some specific properties of the key schedule, properties that allow splitting the keys space (2 keys) in subspaces based on some well-defined criteria. The pra...

In this paper, we describe a sequence of simple, yet efficient chosen-plaintext (or chosen-ciphertext) attacks against reduced-round versions of IDEA (with 2, 2.5, 3, 3.5, and 4 rounds) which compare favourably with the best known attacks: some of them decrease considerably the time complexity given the same order of data at disposal while other ones decrease the amount of necessary knownor cho...