1129 search results - page 68 / 226 » Modular Ranking Abstraction |
EUROCRYPT
1999
Springer
14 years 1 months ago
1999
Springer
Abstract. We present the first efficient statistical zero-knowledge protocols to prove statements such as: – A committed number is a prime. – A committed (or revealed) number ...
FPL
2010
Springer
13 years 7 months ago
2010
Springer
Abstract--Modular multiplication of long integers is an important building block for cryptographic algorithms. Although several FPGA accelerators have been proposed for large modul...
CONCUR
2005
Springer
14 years 3 months ago
2005
Springer
Usually, ranking function synthesis and invariant generation oop with integer variables involves abstracting the loop to have real variables. Integer division and modulo arithmetic...
WAW
2004
Springer
14 years 3 months ago
2004
Springer
d Abstract) Paolo Boldi† Massimo Santini‡ Sebastiano Vigna∗ Deciding which kind of visit accumulates high-quality pages more quickly is one of the most often debated issue i...
SAS
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. Proving the termination of a flowchart program can be done by exhibiting a ranking function, i.e., a function from the program states to a wellfounded set, which strictl...