Filters








437 Hits in 7.5 sec

Linearly Homomorphic Signatures over Binary Fields and New Tools for Lattice-Based Signatures [chapter]

Dan Boneh, David Mandell Freeman
2011 Lecture Notes in Computer Science  
We propose a linearly homomorphic signature scheme that authenticates vector subspaces of a given ambient space.  ...  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.  ...  We thank Chris Peikert for helpful discussions, and in particular for providing the idea of using continuous Gaussians to prove Proposition 7.  ... 
doi:10.1007/978-3-642-19379-8_1 fatcat:xtj552oyebatdipaazcv7zpxl4

Lattice-based linearly homomorphic signature scheme over binary field

FengHe Wang, YuPu Hu, BaoCang Wang
2012 Science China Information Sciences  
Lattice-based linearly homomorphic signature scheme over binary field. Homomorphic signatures were first suggested by Johnson et al. [8].  ...  To design an efficient post-quantum linearly homomorphic signature scheme, using the pre-image sampling function, a lattice-based linearly homomorphic signature scheme over a binary field is proposed in  ...  The authors wish to thank the anonymous referees for their helpful comments.  ... 
doi:10.1007/s11432-012-4681-9 fatcat:xibla5adbjexhj3mk2betywexq

An Efficient Homomorphic Aggregate Signature Scheme Based on Lattice

Zhengjun Jing
2014 Mathematical Problems in Engineering  
In order to design an efficient postquantum secure HAS scheme, we borrow the idea of the lattice-based LHS scheme over binary field in the single-user case, and develop it into a new lattice-based HAS  ...  Compared with the existing lattice-based homomorphic aggregate signature scheme, our new scheme enjoys shorter signature length and high efficiency.  ...  Acknowledgments This research has been supported by the National Natural Science Foundation of China (no. 61374180, 61373136), the Research Foundation for Humanities and Social Sciences of Ministry of  ... 
doi:10.1155/2014/536527 fatcat:ekiaiqrfibaijoqh4u2d74hikm

Efficient Post-Quantum Secure Network Coding Signatures in the Standard Model

2016 KSII Transactions on Internet and Information Systems  
binary field.  ...  In the security proof, we propose a new method for generating a random lattice and the corresponding trapdoor, which may be used in other cryptographic protocols.  ...  Specifically, our contributions mainly consist of the following aspects: (1) We present a lattice-based network coding signature scheme over binary field in the standard model.  ... 
doi:10.3837/tiis.2016.05.026 fatcat:q3fgiaxfzfap5kwc2izrtthdla

Algebraic (Trapdoor) One-Way Functions and Their Applications [chapter]

Dario Catalano, Dario Fiore, Rosario Gennaro, Konstantinos Vamvourellis
2013 Lecture Notes in Computer Science  
These include publicly verifiable secure outsourcing of polynomials, linearly homomorphic signatures and batch execution of Sigma protocols.  ...  to compute linear operations "in the exponent" over some ring (which may be different from Zp where p is the order of the underlying group X) without knowing the bases.  ...  The U.S. and U.K. Governments are authorized to reproduce and distribute reprints for Government purposes notwithstanding any copyright notation hereon.  ... 
doi:10.1007/978-3-642-36594-2_38 fatcat:kss6boyyqzeb7j57vmyme3x5o4

Review of Cryptographic Schemes applied to Remote Electronic Voting systems: remaining challenges and the upcoming post-quantum paradigm

David Yeregui Marcos del Blanco, Luis Panizo Alonso, Jose Angel Hermida Alonso
2018 Open Mathematics  
In this paper, the authors review the main cryptographic schemes applied to date, as well as the most relevant Post Quantum research in the field.  ...  One of the relevant factors explaining that reality is the lack of studies about the Cryptographic Schemes and Primitives applied to the existing REV solutions.  ...  signatures, LWE-based homomorphic encryption and trapdoors for lattices.  ... 
doi:10.1515/math-2018-0013 fatcat:lsq74gk375d5xfujz5rgo4zrna

Efficient Network Coding Signatures in the Standard Model [chapter]

Dario Catalano, Dario Fiore, Bogdan Warinschi
2012 Lecture Notes in Computer Science  
Very roughly, such signatures allow signing vector spaces (or rather bases of such spaces), and these signatures are homomorphic: given signatures on a set of vectors it is possible to create signatures  ...  In this paper we introduce two new network coding signature schemes.  ...  The authors would like to thank Dennis Hofheinz and Eike Kiltz for helpful discussions in the early stage of this work.  ... 
doi:10.1007/978-3-642-30057-8_40 fatcat:ky5cl7u7izc5vhgnvnhxpvhc5i

Algebraic (trapdoor) one-way functions: Constructions and applications

Dario Catalano, Dario Fiore, Rosario Gennaro, Konstantinos Vamvourellis
2015 Theoretical Computer Science  
When instantiating our protocol with the RSA/Factoring based algebraic OWFs we obtain the first solution which supports small field  ...  F (x) · F (y) = F (x · y), and is ring-homomorphic, meaning that it is possible to compute linear operations "in the exponent" over some ring (which may be different from Z p where p is the order of the  ...  The U.S. and U.K. Governments are authorized to reproduce and distribute reprints for Government purposes notwithstanding any copyright notation hereon.  ... 
doi:10.1016/j.tcs.2015.05.029 fatcat:chg7yzctgzfvfcnfx7ytl52qbi

Post-Quantum and Code-Based Cryptography—Some Prospective Research Directions

Chithralekha Balamurugan, Kalpana Singh, Ganeshvani Ganesan, Muttukrishnan Rajarajan
2021 Cryptography  
Cryptography has been used from time immemorial for preserving the confidentiality of data/information in storage or transit.  ...  This paper provides an overview of the various research directions that have been explored in post-quantum cryptography and, specifically, the various code-based cryptography research dimensions that have  ...  Acknowledgments: This research work has been carried out under the leadership of the Institute for Technological Research SystemX, and therefore granted within the scope of the program "Recherche Exploratoire  ... 
doi:10.3390/cryptography5040038 fatcat:wkb43zunwjagbnljc6brfou4ty

A Review of Cryptographic Electronic Voting

Yun-Xing Kho, Swee-Huay Heng, Ji-Jian Chin
2022 Symmetry  
A vast number of e-voting schemes including mix-net-based e-voting, homomorphic e-voting, blind signature-based e-voting, blockchain-based e-voting, post-quantum e-voting, and hybrid e-voting have been  ...  proposed in the literature for better security and practical implementation.  ...  Some studies have proposed homomorphic e-voting with lattice-based cryptography and fully homomorphic encryption because fully homomorphic encryption and lattice-based cryptography are new research directions  ... 
doi:10.3390/sym14050858 fatcat:6dzkgrpxgfaanfaxwu3t7teco4

Homomorphic Signatures from Chameleon Hash Functions

Dong Xie, Haipeng Peng, Lixiang Li, Yixian Yang
2017 Information Technology and Control  
In a homomorphic signature scheme, given a k -length message set KEYWORDS: homomorphic signature schemes, chameleon hash functions, small integer solution, lattice.  ...  Information Technology and Control 2017/2/46  ...  Acknowledgments The authors gratefully thank the reviewers for their valuable comments. This paper is supported by the National Key  ... 
doi:10.5755/j01.itc.46.2.14320 fatcat:simgfdjk2zba5o4l7ugx5rgb54

Homomorphic Encryption — Theory and Application [chapter]

Jaydip Sen
2013 Theory and Practice of Cryptography and Network Security Protocols and Technologies  
(iii) New tools for lattice-based signatures: the scheme is unforgeable based on a new hard problem on lattices, which the authors have called the k-small integer solutions (k-SIS) problem.  ...  The work has three major contributions in the state of the art as identified by the authors: (i) Homomorphic signatures over F 2 : the authors have constructed the first unforgeable linearly homomorphic  ... 
doi:10.5772/56687 fatcat:amgaohpdbnal3ly6nsx4nvasmm

Homomorphic Encryption: Theory & Applications [article]

Jaydip Sen
2013 arXiv   pre-print
The goal of this chapter is to present a survey of homomorphic encryption techniques and their applications.  ...  Various applications and salient properties of homomorphic encryption schemes are then discussed in detail.  ...  (iii) New tools for lattice-based signatures: the scheme is unforgeable based on a new hard problem on lattices, which the authors have called the k-small integer solutions (k-SIS) problem.  ... 
arXiv:1305.5886v1 fatcat:agzyco4ehnfajiamrbp7qobo2a

On the Security Notions for Homomorphic Signatures [chapter]

Dario Catalano, Dario Fiore, Luca Nizzardo
2018 Lecture Notes in Computer Science  
(ASIACRYPT'13) for homomorphic MACs.  ...  into one secure under the new stronger notion.  ...  the semi-adaptive model, and is based on standard lattices.  ... 
doi:10.1007/978-3-319-93387-0_10 fatcat:kygvk46kvfa2jhpkd36hwtpblu

Linearly Time Efficiency in Unattended Wireless Sensor Networks [chapter]

Faezeh Sadat, Fattaneh Bayat
2012 Real-Time Systems, Architecture, Scheduling, and Application  
Applied linear homomorphic signature over In this paper, we utilize Boneh et al. scheme which is inspired by Gentry, Peikert and Vaikuntanathan [6] defined linearly over binary field [7] .  ...  Moreover, based on this equation and boundary conditions, a new function for every sensor is released.  ... 
doi:10.5772/39275 fatcat:hwzccffstrb3bj6eicqpqjchcy
« Previous Showing results 1 — 15 out of 437 results