Articles producció científica> Enginyeria Informàtica i Matemàtiques

Improving the Linear Programming Technique in the Search for Lower Bounds in Secret Sharing

  • Datos identificativos

    Identificador: imarina:9138837
    Handle: https://hdl.handle.net/20.500.11797/imarina9138837
    Autores:
    Farràs OKaced TMartín SPadró C
    Resumen:
    © 1963-2012 IEEE. We present a new improvement in the linear programming technique to derive lower bounds on the information ratio of secret sharing schemes. We obtain non-Shannon-type bounds without using information inequalities explicitly. Our new technique makes it possible to determine the optimal information ratio of linear secret sharing schemes for all access structures on 5 participants and all graph-based access structures on 6 participants. In addition, new lower bounds are presented also for some small matroid ports and, in particular, the optimal information ratios of the linear secret sharing schemes for the ports of the Vamos matroid are determined.

  • Otros:

    Autor según el artículo: Farràs O; Kaced T; Martín S; Padró C
    Departamento: Enginyeria Informàtica i Matemàtiques
    e-ISSN: 1557-9654
    Autor/es de la URV: Farràs Ventura, Oriol
    Palabras clave: Secret sharing schemes Rank inequalities Linear programming Information inequalities Common information
    Resumen: © 1963-2012 IEEE. We present a new improvement in the linear programming technique to derive lower bounds on the information ratio of secret sharing schemes. We obtain non-Shannon-type bounds without using information inequalities explicitly. Our new technique makes it possible to determine the optimal information ratio of linear secret sharing schemes for all access structures on 5 participants and all graph-based access structures on 6 participants. In addition, new lower bounds are presented also for some small matroid ports and, in particular, the optimal information ratios of the linear secret sharing schemes for the ports of the Vamos matroid are determined.
    Áreas temáticas: Matemática / probabilidade e estatística Library and information sciences Information systems Engineering, electrical & electronic Engenharias iv Engenharias iii Computer science, information systems Computer science applications Ciencias sociales Ciência da computação Astronomia / física
    Acceso a la licencia de uso: https://creativecommons.org/licenses/by/3.0/es/
    ISSN: 0018-9448
    Direcció de correo del autor: oriol.farras@urv.cat
    Identificador del autor: 0000-0002-7495-5980
    Fecha de alta del registro: 2023-02-19
    Versión del articulo depositado: info:eu-repo/semantics/acceptedVersion
    Enlace a la fuente original: https://ieeexplore.ieee.org/document/9127978
    Referencia al articulo segun fuente origial: Ieee Transactions On Information Theory. 66 (11): 7088-7100
    Referencia de l'ítem segons les normes APA: Farràs O; Kaced T; Martín S; Padró C (2020). Improving the Linear Programming Technique in the Search for Lower Bounds in Secret Sharing. Ieee Transactions On Information Theory, 66(11), 7088-7100. DOI: 10.1109/TIT.2020.3005706
    URL Documento de licencia: https://repositori.urv.cat/ca/proteccio-de-dades/
    DOI del artículo: 10.1109/TIT.2020.3005706
    Entidad: Universitat Rovira i Virgili
    Año de publicación de la revista: 2020
    Tipo de publicación: Journal Publications

  • Palabras clave:

    Computer Science Applications,Computer Science, Information Systems,Engineering, Electrical & Electronic,Information Systems,Library and Information Sciences
    Secret sharing schemes
    Rank inequalities
    Linear programming
    Information inequalities
    Common information
    Matemática / probabilidade e estatística
    Library and information sciences
    Information systems
    Engineering, electrical & electronic
    Engenharias iv
    Engenharias iii
    Computer science, information systems
    Computer science applications
    Ciencias sociales
    Ciência da computação
    Astronomia / física

  • Documentos:

    DocumentPrincipal

  • Cerca a google

    Search to google scholar