13 search results - page 1 / 3 » Non-interactive Proofs for Integer Multiplication |
FC
2008
Springer
13 years 9 months ago
2008
Springer
Oblivious transfer (OT) is a fundamental primitive used in many cryptographic protocols, including general secure function evaluation (SFE) protocols. However, interaction is a pri...
EUROCRYPT
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We present two universally composable and practical protocols by which a dealer can, verifiably and non-interactively, secret-share an integer among a set of players. Mo...
ARITH
2007
IEEE
14 years 1 months ago
2007
IEEE
Abstract— This paper explores the use of the double-base number system (DBNS) for constant integer multiplication. The DBNS recoding scheme represents integers – in this case c...
TIT
2011
13 years 2 months ago
2011
For integer r satisfying 0 ≤ r ≤ p − 2, a sequence family Ωr of polyphase sequences of prime period p, size (p − 2)pr , and maximum correlation at most 2 + (r + 1) √ p...
SACRYPT
2004
Springer
14 years 21 days ago
2004
Springer
Addition-subtraction-chains obtained from signed digit recodings of integers are a common tool for computing multiples of random elements of a group where the computation of invers...