CT-RSA '02 Proceedings of the The Cryptographer's Track at the RSA Conference on Topics in Cryptology
ICISC '01 Proceedings of the 4th International Conference Seoul on Information Security and Cryptology
Worst-Case to Average-Case Reductions Based on Gaussian Measures
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Digitally signed document sanitizing scheme based on bilinear maps
ASIACCS '06 Proceedings of the 2006 ACM Symposium on Information, computer and communications security
Foundations and Trends® in Networking
Efficient signature schemes supporting redaction, pseudonymization, and data deidentification
Proceedings of the 2008 ACM symposium on Information, computer and communications security
Trapdoors for hard lattices and new cryptographic constructions
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
International Journal of Information and Coding Theory
Signing a Linear Subspace: Signature Schemes for Network Coding
Irvine Proceedings of the 12th International Conference on Practice and Theory in Public Key Cryptography: PKC '09
Security of Sanitizable Signatures Revisited
Irvine Proceedings of the 12th International Conference on Practice and Theory in Public Key Cryptography: PKC '09
Short Redactable Signatures Using Random Trees
CT-RSA '09 Proceedings of the The Cryptographers' Track at the RSA Conference 2009 on Topics in Cryptology
Asymptotically efficient lattice-based digital signatures
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Redactable signatures for tree-structured data: definitions and constructions
ACNS'10 Proceedings of the 8th international conference on Applied cryptography and network security
Discrete-Log-Based signatures may not be equivalent to discrete log
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
ESORICS'05 Proceedings of the 10th European conference on Research in Computer Security
Secure network coding over the integers
PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
Bonsai trees, or how to delegate a lattice basis
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
Homomorphic signatures for polynomial functions
EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
The geometry of lattice cryptography
Foundations of security analysis and design VI
On constructing homomorphic encryption schemes from coding theory
IMACC'11 Proceedings of the 13th IMA international conference on Cryptography and Coding
Computing on authenticated data
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
Efficient network coding signatures in the standard model
PKC'12 Proceedings of the 15th international conference on Practice and Theory in Public Key Cryptography
Improved security for linearly homomorphic signatures: a generic framework
PKC'12 Proceedings of the 15th international conference on Practice and Theory in Public Key Cryptography
Computing on authenticated data: new privacy definitions and constructions
ASIACRYPT'12 Proceedings of the 18th international conference on The Theory and Application of Cryptology and Information Security
Algebraic (trapdoor) one-way functions and their applications
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
Verifiable delegation of computation on outsourced data
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
Computing on authenticated data for adjustable predicates
ACNS'13 Proceedings of the 11th international conference on Applied Cryptography and Network Security
How to share a lattice trapdoor: threshold protocols for signatures and (H)IBE
ACNS'13 Proceedings of the 11th international conference on Applied Cryptography and Network Security
A new definition of homomorphic signature for identity management in mobile cloud computing
Journal of Computer and System Sciences
Slight Homomorphic Signature for Access Controlling in Cloud Computing
Wireless Personal Communications: An International Journal
Hi-index | 0.00 |
We propose a linearly homomorphic signature scheme that authenticates vector subspaces of a given ambient space. Our system has several novel properties not found in previous proposals: • It is the first such scheme that authenticates vectors defined over binary fields; previous proposals could only authenticate vectors with large or growing coefficients. • It is the first such scheme based on the problem of finding short vectors in integer lattices, and thus enjoys the worst-case security guarantees common to lattice-based cryptosystems. Our scheme can be used to authenticate linear transformations of signed data, such as those arising when computing mean and Fourier transform or in networks that use network coding. Our construction gives an example of a cryptographic primitive -- homomorphic signatures over F2 -- that can be built using lattice methods, but cannot currently be built using bilinear maps or other traditional algebraic methods based on factoring or discrete log type problems. Security of our scheme (in the random oracle model) is based on a new hard problem on lattices, called k-SIS, that reduces to standard average-case and worst-case lattice problems. Our formulation of the k-SIS problem adds to the "toolbox" of lattice-based cryptography and may be useful in constructing other lattice-based cryptosystems. As a second application of the new k-SIS tool, we construct an ordinary signature scheme and prove it k-time unforgeable in the standard model assuming the hardness of the k-SIS problem. Our construction can be viewed as "removing the random oracle" from the signatures of Gentry, Peikert, and Vaikuntanathan at the expense of only allowing a small number of signatures.