Abstract: We study random string-duplication systems, called Pólya string models, motivated by certain random mutation processes in the genome of living organisms. Unlike previous works that study the ...
Abstract: We present the first constant-round non-malleable commitment scheme and the first constant-round non-malleable zero-knowledge argument system, as defined by Dolev, Dwork and Naor (1991).
NewLenChars returns a new random string of the provided length, consisting of the provided string of allowed characters (maximum 63).
Some results have been hidden because they may be inaccessible to you
Show inaccessible results