METHOD AND SYSTEM FOR PRIVACY-PRESERVING LOGISTIC REGRESSION TRAINING BASED ON HOMOMORPHICALLY ENCRYPTED CIPHERTEXTS

    公开(公告)号:US20240061955A1

    公开(公告)日:2024-02-22

    申请号:US18260776

    申请日:2021-01-08

    CPC classification number: G06F21/6245 H04L9/008

    Abstract: There is provided a method of privacy-preserving logistic regression training based on homomorphically encrypted ciphertexts. The method includes: obtaining a first packed ciphertext comprising at least a portion of a first training data sample packed into a first vector of slots thereof for training a privacy-preserving logistic regression model; obtaining a second packed ciphertext comprising a plurality of weights of the privacy-preserving logistic regression model packed into a first vector of slots thereof; determining at least a first output probability of the privacy-preserving logistic regression model based on the first packed ciphertext and the second packed ciphertext; and updating the plurality of weights based on the first output probability. There is also provided a corresponding system for privacy-preserving logistic regression training based on homomorphically encrypted data.

    DATA STRIPPING, ALLOCATION AND RECONSTRUCTION

    公开(公告)号:US20180246793A1

    公开(公告)日:2018-08-30

    申请号:US15553976

    申请日:2016-02-26

    Abstract: A method for data stripping, allocation and reconstruction in an active drive storage system including a plurality of active object storage devices, each of the plurality of active object storage devices including one or more storage devices and a controller is provided. The method includes the controller of the identified one of the plurality of active object storage devices segmenting the received data into a plurality of data chunks and generating one or more parity chunks in response to the plurality of data chunks. The method further includes the controller of the identified one of the plurality of active object storage devices reorganizing the plurality of data chunks and the one or more parity chunks in response to a number of the plurality of data chunks and a number of the one or more of the plurality of active object storage devices into which the received data is to be stored. Finally, the method includes the step of the controller of the identified one of the plurality of active object storage devices storing the plurality of data chunks and the one or more parity chunks into the one or more of the plurality of active object storage devices.

    Dual Actuator Hard Disk Drive
    8.
    发明申请

    公开(公告)号:US20180226091A1

    公开(公告)日:2018-08-09

    申请号:US15506689

    申请日:2015-10-02

    CPC classification number: G11B5/5578 G06F12/0223 G11B5/012 G11B5/4813

    Abstract: Described are systems and methods for implementation in relation to hard disk drives. The disclosure is direct, at least in part, to a method for writing data in a multiple actuator multiple disk system, and the multiple actuator disk system for performing that method. The method comprises receiving the data and dividing the data into at least a first predetermined portion and a second predetermined portion. The method also includes and writing the first predetermined portion of the data onto a first disk surface of the multiple actuator multiple disk system using a first actuator of the multiple actuators while writing the second predetermined portion of the data onto a second disk surface of the multiple actuator multiple disk system using a second actuator of the multiple actuators.

    METHOD OF CONSTRUCTING FLAT XOR CODES FROM INTEGER INDEXED TANNER GRAPHS

    公开(公告)号:US20170279462A1

    公开(公告)日:2017-09-28

    申请号:US15508718

    申请日:2015-09-29

    CPC classification number: H03M13/1102 H03M13/036 H03M13/05 H03M13/373

    Abstract: A method for defining an erasure code for system having a predetermined number of data disks is disclosed. The method includes selecting step, constructing step, determining step and repeating step. The selecting step includes selecting a predetermined acceptable number of failures for the system. The constructing step includes constructing a first Tanner graph for two failures acceptable system having predetermined number of data disks. The determining step includes determining erasure code from the first Tanner graph. The repeating step includes repeating the constructing step and the determining step by increasing the acceptable number of failures by one and constructing another Tanner graph in response to the increased acceptable number of failures by increasing number of parity nodes until the predetermined number of failures for the system is reached.

    RAID PARITY STRIPE RECONSTRUCTION
    10.
    发明申请
    RAID PARITY STRIPE RECONSTRUCTION 审中-公开
    RAID奇偶校验重建

    公开(公告)号:US20160217040A1

    公开(公告)日:2016-07-28

    申请号:US14914238

    申请日:2014-08-27

    CPC classification number: G06F11/1088 G06F3/0619 G06F3/064 G06F3/0689

    Abstract: Data reconstruction in a RAID storage system, by determining if a parity stripe has been reconstructed and if the parity stripe has been allocated, by the checking of a reconstruction/rebuild table and a space allocation table. Before reconstruction of a parity stripe occurs, the non-volatile memory of a failed hybrid drive is checked to determine if it is accessible and if so the data is copied to the new hybrid drive instead of reconstruction occurring.

    Abstract translation: 通过检查重建/重建表和空间分配表,确定RAID存储系统中的数据重建,通过确定奇偶校验条带是否已被重构,并且奇偶校验条带是否已被分配。 在重建奇偶校验条带之前,检查故障混合驱动器的非易失性存储器以确定其是否可访问,如果是,则将数据复制到新的混合驱动器而不是发生重建。

Patent Agency Ranking