Loading…
netrik182
Translation reverted |
|
admin
Marked for edit |
|
georgeggot
Suggestion accepted |
|
ivaylo7s
Suggestion added |
|
Wobole
Comment added |
To be honest, I am not sure if I can translate this abstract technically correct. As I don't want to create confusion, I am going to leave it as it is for now. Maybe somebody more technophilic than I am could chip in here. 3 years ago |
Wobole
Comment added |
To be honest, I am not sure if I can translate this abstract technically correct. As I don't want to create confusion, I am going to leave it as it is for now. Maybe somebody more technophilic than I am could chip in and help out here. 3 years ago |
Translation comment
To be honest, I am not sure if I can translate this abstract technically correct. As I don't want to create confusion, I am going to leave it as it is for now. Maybe somebody more technophilic than I am could chip in here.
e demonstrate that a version of non-slanderability is a natural definition of unforgeabilir zeigen, dass eine Version der Unverfälschbarkeit eine natürliche Definition der UnverfälschbarkeityfoürlinkablverknüpfbarerRings. We present a linkabln ist. Wir stellen eine verknüpfbarerRinge ckonstrucktionwmith concise sprägnanten Signatures an und multi-ehrdimensionalkeys that is linkably anonymous if a variation of the decisionalen Schlüsseln vor, die verknüpfbar anonym ist, wenn eine Variation des entscheidungsorientierten Diffie-Hellmanp-Problemwith random oracles is hs mit zufälligen Orakeln hart ist, verknüpfbard,linkable if key aggregation is a one-waywenn die Schlüsselaggregation eine Einwegfuncktion ist,aund non-slanderable if a one-moicht verleumderisch, wenn eine weiterevVariationof thedes disckreteln Logarithmis hard. We remark on some applicationst ist. Wir weisen auf einige Anwendungen in signer-ambiguous confidential transaction modelswithout trusted setupohne vertrauenswürdiges Setup hin.