
doi: 10.1007/10718964_37
Threshold cryptosystems use algebraic properties such as homomorphisms in order to allow several parties to jointly evaluate a cryptographic primitive. Several cryptographic primitives, however, avoid -by definition- the use of algebraic properties, or otherwise their security is compromised; this is the case, for instance, of block ciphers, pseudo-random functions, and pseudo-random permutations. Is it then impossible to construct a threshold cryptosystem in order to share the computation of a block cipher ?
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 16 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
