BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//wp-events-plugin.com//6.4.7.1//EN
TZID:Europe/Paris
X-WR-TIMEZONE:Europe/Paris
BEGIN:VEVENT
UID:3705@test.i2m.univ-amu.fr
DTSTART;TZID=Europe/Paris:20150312T143000
DTEND;TZID=Europe/Paris:20150312T153000
DTSTAMP:20200828T141557Z
URL:https://test.i2m.univ-amu.fr/events/secret-sharing-schemes-with-a-larg
e-number-of-players-from-toric-varieties/
SUMMARY:Secret Sharing Schemes with a large number of players from Toric Va
rieties - Johan P. Hansen
DESCRIPTION:A general theory for constructing linear secret sharing schemes
over a finite field $\\Fq$ from toric varieties is introduced. The number
of players can be as large as $(q-1)^r-1$ for $r\\geq 1$.\nWe present gen
eral methods to obtain the reconstruction and privacy thresholds as well a
s conditions for multiplication on the associated secret sharing schemes.\
nIn particular we apply the method on certain toric surfaces. The main res
ults are ideal linear secret sharing schemes where the number of players c
an be as large as $(q-1)^2-1$\, we determine bounds for the reconstruction
and privacy thresholds and conditions for strong multiplication using the
cohomology and the intersection theory on toric surfaces.\nJohan P. Hanse
n\, Aarhus University\n\n
CATEGORIES:Séminaire Arithmétique et Théorie de l’Information (ATI)
END:VEVENT
BEGIN:VTIMEZONE
TZID:Europe/Paris
X-LIC-LOCATION:Europe/Paris
BEGIN:STANDARD
DTSTART:20141026T020000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
END:STANDARD
END:VTIMEZONE
END:VCALENDAR