non-malleable codes for bounded parallel-time tampering
Published 3 years ago • 140 plays • Length 24:59Download video MP4
Download video MP3
Similar videos
-
20:22
non malleable codes for space bounded tampering
-
25:14
non-malleable codes against bounded polynomial time tampering
-
4:56
continuously non-malleable codes against bounded-depth tampering
-
23:16
non-malleable codes, extractors and secret sharing for interleaved tampering and composition o...
-
18:50
explicit rate-1 non-malleable codes for local tampering
-
23:01
non malleable codes for partial functions with manipulation detection
-
17:53
non-malleable codes from two-source extractors
-
23:18
continuous space-bounded non-malleable codes from stronger proofs-of-space
-
46:29
malebolgia - structured concurrency for nim by andreas rumpf
-
33:29
secure numerical computations using fully homomorphic encryption | schlottke-lakemper, kholod
-
48:53
from algorithm to generic, parallel code - dietmar kuhl - cppcon 2019
-
20:33
non-malleable codes for decision trees
-
17:17
non-malleable secret sharing against bounded joint-tampering attacks in the plain model
-
27:30
ccs 2016 - practical non-malleable codes from i-more extractable hash functions
-
25:10
continuous non-malleable codes in the 8-split-state model
-
25:07
continuous non-malleable codes
-
30:13
non-malleable codes against constant split-state tampering
-
15:29
continuously non-malleable secret sharing: joint tampering, plain model and capacity
-
26:10
non-malleability against polynomial tampering
-
24:19
interactive non-malleable codes (tcc 2019)
-
20:13
explicit non malleable codes against bit wise tampering adn permutations
-
3:43
non-malleable codes in the split-state model