Now showing items 1-4 of 4
Zero-knowledge proofs for mix-nets of secret shares
Mix-nets can be used to shuffle vectors of shared secrets. This operation can be an important building block for solving combinatorial problems where constraints are secret to different participants. A main contribution ...
Secure stochastic multi-party computation for combinatorial problems
High levels of security often imply that the computation time should be independent of the value of involved secrets. When the expected answer of the solver is either a solution or "unsatisfiable", then the previous ...
Iterative segmentation in keyword spotting: relation to fractional programming
This paper addresses the problem of detecting keywords in unconstrained speech. The proposed algorithms search for the speech segment maximizing the average observation probability along the most likely path in the ...
Secure combinatorial optimization using DFS-based variable elimination
It is known that, in general, Constraint Optimization Problems (COP) are NP-hard. Existing arithmetic circuits for secure protocols solving such problems are exponential in the number of variables, $n$. Recently a combinatorial ...