Filters








18 Hits in 6.8 sec

Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE [chapter]

Shweta Agrawal, Dan Boneh, Xavier Boyen
2010 Lecture Notes in Computer Science  
The resulting systems are very different from earlier lattice-based HIBEs and in some cases result in shorter ciphertexts and private keys. We prove security from classic lattice hardness assumptions.  ...  We present a technique for delegating a short lattice basis that has the advantage of keeping the lattice dimension unchanged upon delegation.  ...  We thank David Freeman, Daniele Micciancio and Brent Waters for helpful comments about this work.  ... 
doi:10.1007/978-3-642-14623-7_6 fatcat:vcvolzneufcq5hcwkiziswxlaq

Quantum-safe HIBE: does it cost a Latte? [article]

Raymond K. Zhao, Sarah McCarthy, Ron Steinfeld, Amin Sakzad, Máire O'Neill
2021 IACR Cryptology ePrint Archive  
In addition to providing quantum-safe traditional PKI, lattices support advanced primitives such as identity-based encryption (IBE).  ...  As expected, the KeyGen, Extract, and Delegate components are the most time consuming, with Extract experiencing a 35% decrease in op/s from the first to second hierarchical level at 80-bit security.  ...  In addition, in Latte Delegate, to complete the delegated basis S for lattice dimension higher than 2N , we adapt the technique from ModFalcon [11] .  ... 
dblp:journals/iacr/ZhaoMSSO21 fatcat:bd4hrwi43nem7au5lfmokses4i

Efficient Identity-Based Broadcast Encryption Scheme on Lattices for the Internet of Things

Kai He, Xueqiao Liu, Jia-Nan Liu, Wei Liu, David Megias
2021 Security and Communication Networks  
Thus, we present an IBBE scheme from the lattice, in which we employ the Chinese remainder theorem and lattice basis delegation in fixed dimensions to obtain several desirable characteristics, such as  ...  constant-size public parameter, private key, and ciphertext.  ...  Shweta Agrawal and Boyen [31] proposed a lattice basis delegation technique which does not increase the dimension of the lattices involved and presented two HIBE schemes with shorter ciphertext and private  ... 
doi:10.1155/2021/2847731 fatcat:r5qgjejmcvh4ppy5bq426tdui4

Bonsai Trees, or How to Delegate a Lattice Basis

David Cash, Dennis Hofheinz, Eike Kiltz, Chris Peikert
2011 Journal of Cryptology  
We then show that bonsai trees resolve some central open questions in lattice-based cryptography: to summarize, they remove the need for random oracles in many important applications, and facilitate delegation  ...  for purposes such as hierarchical IBE.  ...  By combining natural, undirected growth with controlled propagation techniques Acknowledgments We thank the anonymous reviewers for their helpful comments, and for pointing out a small error in an earlier  ... 
doi:10.1007/s00145-011-9105-2 fatcat:rvpebkwqpjdjnmxkaamfffulbq

Bonsai Trees, or How to Delegate a Lattice Basis [chapter]

David Cash, Dennis Hofheinz, Eike Kiltz, Chris Peikert
2010 Lecture Notes in Computer Science  
We then show that bonsai trees resolve some central open questions in lattice-based cryptography: to summarize, they remove the need for random oracles in many important applications, and facilitate delegation  ...  for purposes such as hierarchical IBE.  ...  By combining natural, undirected growth with controlled propagation techniques Acknowledgments We thank the anonymous reviewers for their helpful comments, and for pointing out a small error in an earlier  ... 
doi:10.1007/978-3-642-13190-5_27 fatcat:r6f2xojvhvf6xagod4algivijm

Efficient Lattice (H)IBE in the Standard Model [chapter]

Shweta Agrawal, Dan Boneh, Xavier Boyen
2010 Lecture Notes in Computer Science  
We extend this basic technique to an adaptively-secure IBE and a Hierarchical IBE. * This paper combines preliminary results that appeared in Eurocrypt'10 [1] and PKC'10 [13]. † Supported by NSF and the  ...  IBE and Hierarchical IBE Recall that an Identity-Based Encryption system (IBE) consists of four algorithms [37, 10]: Setup, Extract, Encrypt, Decrypt.  ...  Acknowledgments We are grateful to Chris Peikert for suggesting that we use the basis extension method from [33] to simplify the analysis of algorithm SampleLeft.  ... 
doi:10.1007/978-3-642-13190-5_28 fatcat:4wmjj4akzjhunlntsgap7wwune

Puncturable Encryption: A Generic Construction from Delegatable Fully Key-Homomorphic Encryption [article]

Willy Susilo, Dung Hoang Duong, Huy Quoc Le, Josef Pieprzyk
2020 arXiv   pre-print
We also discuss about the ability of modification our framework to support the unbounded number of ciphertext tags inspired from the work of Brakerski and Vaikuntanathan at CRYPTO 2016.  ...  From this view, we propose a generic PE construction from the fully key-homomorphic encryption, augmented with a key delegation mechanism (DFKHE) from Boneh et al. at Eurocrypt 2014.  ...  Chow and anonymous reviewers for their insightful comments which improve the content and presentation of the manuscript.  ... 
arXiv:2007.06353v1 fatcat:ukwzao7xazehbhbqarwdus4mzm

Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller [chapter]

Daniele Micciancio, Chris Peikert
2012 Lecture Notes in Computer Science  
We give new methods for generating and using "strong trapdoors" in cryptographic lattices, which are simultaneously simple, efficient, easy to implement (even in parallel), and asymptotically optimal with  ...  Our methods involve a new kind of trapdoor, and include specialized algorithms for inverting LWE, randomly sampling SIS preimages, and securely delegating trapdoors.  ...  Our method has several advantages over the previous basis delegation algorithm of [13] : first and most importantly, the size of the delegated trapdoor grows only linearly with the dimension m of Λ ⊥  ... 
doi:10.1007/978-3-642-29011-4_41 fatcat:xykbsklp2vasbl3ybrt5hxyudy

A survey on Functional Encryption [article]

Carla Mascia, Massimiliano Sala, Irene Villa
2021 arXiv   pre-print
In this paper, we review all FE classes, describing their functionalities and main characteristics.  ...  In particular, for each class we mention several schemes, providing their security assumptions and comparing their properties.  ...  We would like to thank Andrea Gelpi, Marco Pedicini, and Michela Iezzi, for their interest and valuable discussion on the subject.  ... 
arXiv:2106.06306v1 fatcat:i76bnyo2uvak5plpyexpntwb74

A survey on functional encryption

Carla Mascia, Massimiliano Sala, Irene Villa
2021 Advances in Mathematics of Communications  
In this paper, we review all FE classes, describing their functionalities and main characteristics.  ...  In particular, we mention several schemes for each class, providing their security assumptions and comparing their properties.  ...  We would like to thank Andrea Gelpi, Marco Pedicini, and Michela Iezzi for their interest and valuable discussion on the subject. We also thank the anonymous referee for the helpful comments.  ... 
doi:10.3934/amc.2021049 fatcat:l3j4d2kfwrbdvk7ff4hrg7leo4

Practical and post-quantum authenticated key exchange from one-way secure key encapsulation mechanism

Atsushi Fujioka, Koutarou Suzuki, Keita Xagawa, Kazuki Yoneyama
2013 Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security - ASIA CCS '13  
We propose a generic construction of AKE protocols from OW-CCA secure KEMs and prove CK + security of the protocols in the random oracle model.  ...  systems, and more.  ...  Lattice basis delegation in fixed dimension and shorter-ciphertext hierarchical IBE. In Rabin [51] , pp. 98-115.[3] Ajtai, M., and Dwork, C.  ... 
doi:10.1145/2484313.2484323 dblp:conf/ccs/FujiokaSXY13 fatcat:jftnjbexxjf6dhgturlyqokl4m

Constrained Keys for Invertible Pseudorandom Functions [chapter]

Dan Boneh, Sam Kim, David J. Wu
2017 Lecture Notes in Computer Science  
Constrained PRFs have found numerous applications in cryptography [BW13, KPTZ13, BGI14]: they imply identity-based key exchange and broadcast encryption, and are a crucial ingredient in many applications  ...  IPFs and deterministic encryption. While constrained IPFs are interesting in their own right, they come up naturally in the context of deterministic encryption.  ...  Opinions, findings and conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect the views of DARPA.  ... 
doi:10.1007/978-3-319-70500-2_9 fatcat:gusmoqldtzg27m7nylzhsm27ca

Efficient and Secure Data Sharing Using Attribute-based Cryptography [article]

MASOOMEH SEPEHRI
2018
The proposed scheme delegates the re-encryption capability to a semi-trusted proxy who can transform a delegator's ciphertext associated with an attribute vector to a new ciphertext associated with delegatee's  ...  The proposed E-IPPRE scheme requires constant pairing operations for its algorithms and ensures a short size of the public key, private key, and ciphertext, making it the most efficient and practical compared  ...  ., a hierarchical IPE scheme was proposed by Okamoto et al. [65] , which used n-dimensional vector spaces in prime order bilinear groups and achieves full security under the standard model.  ... 
doi:10.13130/sepehri-masoomeh_phd2018-02-28 fatcat:5jone24k5redxk5lm26ifqunnm

Improvements and New Constructions of Digital Signatures

Jessica Koch
2019
Damit ist der Einsatz von digitalen Signaturen für viele Anwendungen in der Praxis sehr wichtig.  ...  Ein digitales Signaturverfahren, oft auch nur digitale Signatur genannt, ist ein wichtiger und nicht mehr wegzudenkender Baustein in der Kryptographie.  ...  They reduce the size of the signature by adopting the technique of lattice basis delegation with fixed dimension.  ... 
doi:10.5445/ir/1000097524 fatcat:bswwgx2b5jgjfp2jaabfn6zpu4

Uncertainty modeling and analysis with intervals: Foundations, tools, applications (Dagstuhl Seminar 11371) Quantum Cryptanalysis (Dagstuhl Seminar 11381) Public-Key Cryptography (Dagstuhl Seminar 11391)

Markus Schneider, Gottfried Vossen, Esteban Zimányi, Isaac Elishakoff, Vladik Kreinovich, Wolfram Luther, Evgenija Popova, Serge Fehr, Michele Mosca, Martin Rötteler, Rainer, Marc Fischlin (+3 others)
2011 unpublished
Acknowledgements We would like to thank the staff of Schloss Dagstuhl for their help in organizing this seminar and for the excellent facilities.  ...  Thanks go to Martin Fuchs for his help in collecting abstracts of the talks and other related materials for these proceedings. -Public-Key  ...  In our work we exploit the fact that the most frequent queries in a data warehouse join fact a table with the Time dimension and the fact that dimensions have often a hierarchical structure.  ... 
fatcat:xrywj3jmmnb5dm2ohmysv2zxjm
« Previous Showing results 1 — 15 out of 18 results