"Secrecy Computation without Changing Polynomial Degree in Shamir's (K, N) ..."

Takeshi Shingu, Keiichi Iwamura, Kitahiro Kaneda (2016)

> Home

Details and statistics

DOI: 10.5220/0005998800890094

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-21

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/icete/ShinguIK16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icete/ShinguIK16
Takeshi Shingu, Keiichi Iwamura, Kitahiro Kaneda:
Secrecy Computation without Changing Polynomial Degree in Shamir's (K, N) Secret Sharing Scheme. DCNET 2016: 89-94

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.