A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
Filters
Programmable Hash Functions in the Multilinear Setting
[chapter]
2013
Lecture Notes in Computer Science
Preserved Fulltext
We adapt the concept of a programmable hash function (PHF, Crypto 2008) to a setting in which a multilinear map is available. This enables new PHFs with previously unachieved parameters. ...
Keywords: programmable hash functions, multilinear maps, identitybased encryption, identity-based non-interactive key exchange, digital signatures. ...
in the multilinear setting
Motivation Programmable hash functions (PHFs) have been defined in [18] as a special type of a group hash function (i.e., a hash function with images in a group). ...
doi:10.1007/978-3-642-40041-4_28
fatcat:45kykcbxmfey7d4i4gv2tasw4u
Attribute-Based Signatures for Circuits from Multilinear Maps
[chapter]
2014
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We prove selective unforgeability of our scheme in the standard model under the Multilinear Computational Diffie-Hellman (MCDH) assumption. The privacy security of our scheme is perfect. ...
In this paper, we construct an Attribute-Based Signature (ABS) scheme for general circuits from multilinear maps. Our scheme is inspired by Garg et al.' ...
Some subsequent works showed that the multilinear maps are a powerful cryptographic primitive, some successful examples including programmable hash functions [8], full domain hash and identity-based aggregate ...
doi:10.1007/978-3-319-13257-0_4
fatcat:dvnj4uoszjgdxfhpepx6be5nly
Regular and almost universal hashing: an efficient implementation
2016
Software, Practice & Experience
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Random hashing can provide guarantees regarding the performance of data structures such as hash tables---even in an adversarial setting. ...
Many existing families of hash functions are universal: given two data objects, the probability that they have the same hash value is low given that we pick hash functions at random. ...
ACKNOWLEDGEMENTS We thank Ivan Kravets for his help with our testing framework, and more specifically with the ARM processors. ...
doi:10.1002/spe.2461
fatcat:6o4qsezgmzftzfa3edkgjfnmrq
Homomorphic signatures with sublinear public keys via asymmetric programmable hash functions
2017
Designs, Codes and Cryptography
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We introduce the notion of asymmetric programmable hash functions (APHFs, for short), which adapts Programmable hash functions, introduced by Hofheinz and Kiltz (Crypto 2008, Springer, 2008, with two main ...
Second, in addition to the usual programmability, APHFs may have an alternative property that we call programmable pseudorandomness. ...
Second, we analyze the relation between asymmetric hash functions and the PHFs in the multilinear setting introduced in [23] . ...
doi:10.1007/s10623-017-0444-3
fatcat:2bfiuhhxprf5xax4k23ysiwzgq
Anonymous Identity-Based Broadcast Encryption with Constant Decryption Complexity and Strong Security
2016
Proceedings of the 11th ACM on Asia Conference on Computer and Communications Security - ASIA CCS '16
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The biggest contribution in our work is the proposed AIBBE scheme with constant decryption complexity and the provable security under the adaptive attack in the standard model. ...
Hence, we propose two new AIBBE schemes to overcome the drawbacks of previous schemes in the state-of-art. ...
The authors would like to thank the reviewers for their valuable suggestions that help to improve the paper greatly. ...
doi:10.1145/2897845.2897853
dblp:conf/ccs/XuLWJ16
fatcat:zu73ct6spjagbob3qp4vqnmc5e
Programmable Hash Functions Go Private: Constructions and Applications to (Homomorphic) Signatures with Shorter Public Keys
[chapter]
2015
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In other words, programmable pseudo-randomness provides another random-oracle-like property for standard model hash functions, that is to "hide" a PRF inside the hash function. ...
We introduce the notion of asymmetric programmable hash functions (APHFs, for short), which adapts Programmable Hash Functions, introduced by Hofheinz and Kiltz at Crypto 2008, with two main differences ...
Second, we analyze the relation between asymmetric hash functions and the PHFs in the multilinear setting introduced in [23] . ...
doi:10.1007/978-3-662-48000-7_13
fatcat:7ndpuplfq5asvi2gbaxsatrfyu
Sakai–Ohgishi–Kasahara identity-based non-interactive key exchange revisited and more
2015
International Journal of Information Security
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is application/pdf.
Previous schemes in the standard model either have merely selective security or require programmable hash functions in the multilinear setting. ...
In the standard model, we show how to instantiate the random oracle in the SOK scheme with a concrete hash function from admissible hash functions (AHFs) and indistinguishability obfuscation. ...
In particular, we are grateful to Dennis for suggesting the construction of (poly, n)-AHFs in Section 4.2. ...
doi:10.1007/s10207-015-0274-0
fatcat:yjz6tfodvbb77cwg2efxjnf3cy
Large-scale and High-speed Privacy Amplification for FPGA-based Quantum Key Distribution
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
This paper designs a new PA scheme for FPGA-based QKD with multilinear modular hash-modular arithmetic hash (MMH-MH) PA and number theoretical transform (NTT) algorithm. ...
Privacy amplification is an essential part in a QKD system to ensure the security of QKD. ...
The multiplication of large numbers is the major part in both multilinear modular hash and modular arithmetic hash. ...
arXiv:2107.01013v1
fatcat:slh36ksivvez3gumntwvgkixcq
Strongly Secure One-Round Group Authenticated Key Exchange in the Standard Model
[chapter]
2013
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
We prove g-eCK security of our GAKE scheme in the standard model under the natural multilinear generalization of the CBDDH assumption. ...
We also extend the proposed 3AKE scheme to a GAKE scheme with more than three group members, based on multilinear maps. ...
Those tags are particularly customized using specific weak Programmable Hash Functions (PHF) [25] for ephemeral key and long-term key respectively, whose output lies in a pairing group. ...
doi:10.1007/978-3-319-02937-5_7
fatcat:cpk4yfqxafbclmvxdxl337n7wi
Programmable Hash Functions from Lattices: Short Signatures and IBEs with Small Key Sizes
[chapter]
2016
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Driven by the open problem raised by Hofheinz and Kiltz (Journal of Cryptology, 2012), we study the formalization of lattice-based programmable hash function (PHF), and give two types of constructions ...
number of matrices/vectors in the security parameter κ. ...
We also thank the anonymous reviewers of ...
doi:10.1007/978-3-662-53015-3_11
fatcat:b5ud4ae7ozdefajmbttvdm5mua
Building In-the-Cloud Network Functions: Security and Privacy Challenges
2021
Proceedings of the IEEE
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
The article surveys the state-of-the-art literature on network function outsourcing, with a special focus on privacy and security issues. ...
In the obfuscation phase, the local control plane sets up parameters of the multilinear map to construct an obfuscator. ...
EVE [23] provides programmer-friendly Rust APIs, which makes it flexible to set the client's own strategies. ...
doi:10.1109/jproc.2021.3127277
fatcat:getxjhn3s5eyllg6nxnpzsgrmq
Generating Searchable Public-Key Ciphertexts With Hidden Structures for Fast Keyword Search
2015
IEEE Transactions on Information Forensics and Security
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
The latter instance enables us to construct an SPCHS scheme with semantic security in the standard model. ...
We prove our scheme to be semantically secure based on the decisional bilinear Diffie-Hellman assumption in the Random Oracle (RO) model. ...
The first author is partly supported by the National Natural Science ...
doi:10.1109/tifs.2015.2442220
fatcat:bxrrxul7tvc7dfnldbdxlwb6qa
Deterministic polynomial identity tests for multilinear bounded-read formulae
2015
Computational Complexity
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Our algorithm runs in time s O(1) · n k O(k) , where s denotes the size of the formula, n denotes the number of variables, and k bounds the number of occurrences of each variable. ...
In such a formula each variable occurs only a constant number of times and each subformula computes a multilinear polynomial. ...
Acknowledgements The authors would like to thank Amir Shpilka for bringing them in touch with each other, and the anonymous reviewers for their comments. ...
doi:10.1007/s00037-015-0097-4
fatcat:5z7zqjuifjetnltve7qeugx5se
Security Analysis of Multilinear Maps over the Integers
[chapter]
2014
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The proposed algorithm's complexityÕ(2 ρ/2 ) is exponentially smaller thanÕ(2 ρ ) of the previous best attack of Coron et al., where ρ is a function of the security parameter. ...
For example, unlike the GGH construction, the subgroup decision assumption holds in the CLT construction. ...
; for example, programmable hash [17] , full-domain hash [22] , functional encryption [19, 20] , witness encryption [21] , and indistinguishability obfuscation [5, 19, 6] . ...
doi:10.1007/978-3-662-44371-2_13
fatcat:u23q5obklbemnmcq5wvqgrpsci
Symbolic Proofs for Lattice-Based Cryptography
2018
Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security - CCS '18
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
(instead of ideals in the commutative setting). ...
The main technical novelty beyond AutoLWE is a set of (semi-)decision procedures for deducibility problems, using extensions of Gröbner basis computations for subalgebras in the (non-)commutative setting ...
The Leftover Hash Lemma is widely used in cryptographic proofs, in particular in the setting of lattice-based cryptography. ...
doi:10.1145/3243734.3243825
dblp:conf/ccs/BartheFGGJS18
fatcat:usfeiudngrdcnisy5nzmoc4nk4
« Previous
Showing results 1 — 15 out of 89 results