62 search results - page 7 / 13 » Groth-Sahai Proofs Revisited |
CP
2008
Springer
15 years 19 days ago
2008
Springer
Abstract. Finding feasible points for which the proof succeeds is a critical issue in safe Branch and Bound algorithms which handle continuous problems. In this paper, we introduce...
82
Voted
TCC
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. Parallel repetition is well known to reduce the error probability at an exponential rate for single- and multi-prover interactive proofs. Bellare, Impagliazzo and Naor (1...
86
Voted
PKC
2009
Springer
15 years 11 months ago
2009
Springer
Sanitizable signature schemes, as defined by Ateniese et al. (ESORICS 2005), allow a signer to partly delegate signing rights to another party, called the sanitizer. That is, the s...
78
Voted
IAT
2007
IEEE
15 years 5 months ago
2007
IEEE
Here we revisit ADOPT-ing and bring two new contributions. One contribution consists of developing variations on the algorithms keeping the improvement in length of chain of causa...
120
click to vote
KR
2010
Springer
15 years 3 months ago
2010
Springer
In discrete dynamical systems change results from actions. As such, given a set of observations, diagnoses often take the form of posited events that result in the observed behavi...