A Framework for UC-Secure Commitments from Publicly Computable Smooth Projective Hashing

Behzad Abdolmaleki,Hamidreza Khoshakhlagh,Daniel Slamanig

doi:10.1007/978-3-030-35199-1_1

A Framework for UC-Secure Commitments from Publicly Computable Smooth Projective Hashing

Behzad Abdolmaleki, Hamidreza Khoshakhlagh + Show 1 more

https://doi.org/10.1007/978-3-030-35199-1_1

Copy DOI

Publication Date: Jan 1, 2019

Citations: 1

Affiliation: University of Tartu, Aarhus University, Austrian Institute of Technology

#Smooth Projective Hash Functions #Smooth Projective Hash + Show 8 more

Abstract
Full-Text PDF
Similar Papers

Abstract

Hash proof systems or smooth projective hash functions (SPHFs) have been proposed by Cramer and Shoup (Eurocrypt’02) and can be seen as special type of zero-knowledge proof system for a language. While initially used to build efficient chosen-ciphertext secure public-key encryption, they found numerous applications in several other contexts. In this paper, we revisit the notion of SPHFs and introduce a new feature (a third mode of hashing) that allows to compute the hash value of an SPHF without having access to neither the witness nor the hashing key, but some additional auxiliary information. We call this new type publicly computable SPHFs (PC-SPHFs) and present a formal framework along with concrete instantiations from a large class of SPHFs.

Full Text