搜索结果: 1-15 共查到“linearly”相关记录47条 . 查询时间(0.109 秒)
The Simplest Multi-key Linearly Homomorphic Signature Scheme
Multi-key homomorphic signatures cryptographic pairings efficient software implementation
2019/7/18
We consider the problem of outsourcing computation on data authenticated by different users. Our aim is to describe and implement the simplest possible solution to provide data integrity in cloud-base...
Linearly-Homomorphic Signatures and Scalable Mix-Nets
Anonymity random shuffling linearly-homomorphic signatures
2019/5/23
Anonymity is a primary ingredient for our digital life. Several tools have been designed to address it such as, for authentication, blind signatures, group signatures or anonymous credentials and, for...
Linearly equivalent S-boxes and the Division Property
Cryptanalysis Division Property RECTANGLE
2019/2/27
Division property is a new cryptanalysis method introduced by Todo at Eurocrypt'15 that proves to be very efficient on block ciphers and stream ciphers. It can be viewed as a generalization or a more ...
PolyShard: Coded Sharding Achieves Linearly Scaling Efficiency and Security Simultaneously
Blockchain Coded Sharding Efficiency Scaling
2018/11/8
Today’s blockchains do not scale in a meaningful sense. As more nodes join the system, the efficiency of the system (computation, communication, and storage) degrades, or at best stays constant. A lea...
Context Hiding Multi-Key Linearly Homomorphic Authenticators
Delegated Computation Homomorphic Authenticators Context Hiding
2018/6/27
Demanding computations are increasingly outsourced to cloud platforms. For such outsourced computations, the efficient verifiability of results is a crucial requirement. When sensitive data is involve...
Hadamard Matrices, d-Linearly Independent Sets and Correlation-Immune Boolean Functions with Minimum Hamming Weights
Boolean functions Correlation-immune Minimum-weight
2018/3/26
It is known that correlation-immune (CI) Boolean functions used in the framework of side channel attacks need to have low Hamming weights. In 2013, Bhasin et al. studied the minimum Hamming weight of ...
A Linearly Homomorphic Signature Scheme From Weaker Assumptions
homomorphic signatures homomorphic encryption delegated computation
2018/1/11
In delegated computing, prominent in the context of cloud computing, guaranteeing both the correctness and authenticity of computations is of critical importance. Homomorphic signatures can be used as...
Linearly Homomorphic Authenticated Encryption with Provable Correctness and Public Verifiability
Authenticated Encryption Public Verifiability Cloud Computing
2017/7/24
In this work the first linearly homomorphic authenticated encryption scheme with public verifiability and provable correctness, called LEPCoV, is presented. It improves the initial proposal by avoidin...
Boosting Linearly-Homomorphic Encryption to Evaluate Degree-2 Functions on Encrypted Data
public-key cryptography homomorphic encryption
2016/1/6
We show a technique to transform a linearly-homomorphic encryption into a homomorphic
encryption scheme capable of evaluating degree-2 computations on ciphertexts. Our transformation is
surprisingly...
Linearly Homomorphic Encryption from DDH
Linearly Homomorphic Encryption Orders of Quadratic Fields
2016/1/4
We design a linearly homomorphic encryption scheme whose security relies on
the hardness of the decisional Diffie-Hellman problem. Our approach requires some special
features of the underlying group...
Under Martin’s Axiom a c.c.c. nonseparable compact space is constructed which maps continuously into [0, 1] with linear fibers. Such a space can not, for instance, map onto [0, 1]ℵ1.
Linearly homomorphic signatures over binary fields and new tools for lattice-based signatures
binary fields lattice-based signatures
2015/8/5
Our scheme can be used to authenticate linear transformations of signed data, such as those arising when computing mean and least squares fit or in networks that use network coding. Our construction g...
Word Free Recall Search Scales Linearly With Number of Items Recalled
Free recall short term memory memory search Sternberg
2015/7/10
I find that the total search time in word free recall, averaged over item position, increases linearly with the number of items recalled. Thus the word free recall search algorithm scales the same as ...
A GLOBALLY CONVERGENT LINEARLY CONSTRAINED LAGRANGIAN METHOD FOR NONLINEAR OPTIMIZATION
large-scale optimization nonlinear programming
2015/7/3
The new algorithm has been implemented in Matlab, with an option to use either MINOS or
SNOPT (Fortran codes) to solve the linearly constrained subproblems. Only first derivatives are
required...
LARGE-SCALE LINEARLY CONSTRAINED OPTIMIZATION
Large-scale Systems Linear Constraints Linear Programming
2015/7/3
An algorithm for solving large-scale nonlinear' programs with linear constraints is presented.
The method combines efficient sparse-matrix techniques as in the revised simplex method
with stable q...