Non-malleable Codes for Bounded Parallel-Time Tampering

Author(s):  
Dana Dachman-Soled ◽  
Ilan Komargodski ◽  
Rafael Pass
Keyword(s):  
2001 ◽  
Vol 100 (1-3) ◽  
pp. 191-216 ◽  
Author(s):  
A.E. Caola ◽  
Y.L. Joo ◽  
R.C. Armstrong ◽  
R.A. Brown

1997 ◽  
Vol 44 (2) ◽  
pp. 345-361
Author(s):  
Robert A. Wagner
Keyword(s):  

1995 ◽  
Vol 05 (02) ◽  
pp. 179-190 ◽  
Author(s):  
WENTONG CAI ◽  
DAVID B. SKILLICORN

The Bird-Meetens formalism is an approach to software development and computation based on datatype theories. In this paper we build new operators for the theory of lists that compute generalized recurrences and show that they have logarithmic parallel time complexity. As many applications can be cast as forms of recurrences, this allows a large range of parallel algorithms to be derived within the Bird-Meertens formalism. We illustrate by deriving a parallel solution to the maximum segment sum problem.


1983 ◽  
Vol 4 (4) ◽  
pp. 413-416 ◽  
Author(s):  
NAOTO ASADA ◽  
TOSHIYUKI SAITO ◽  
TOMIO KANNO ◽  
KAZUWA NAKAO ◽  
TAKAAKI YOSHIMASA ◽  
...  
Keyword(s):  

2020 ◽  
Vol 101 (23) ◽  
Author(s):  
Paul Secular ◽  
Nikita Gourianov ◽  
Michael Lubasch ◽  
Sergey Dolgov ◽  
Stephen R. Clark ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document