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
.
Zero-Knowledge Arguments for Matrix-Vector Relations and Lattice-Based Group Encryption
[chapter]
2016
Lecture Notes in Computer Science
Group encryption (GE) is the natural encryption analogue of group signatures in that it allows verifiably encrypting messages for some anonymous member of a group while providing evidence that the receiver is a properly certified group member. Should the need arise, an opening authority is capable of identifying the receiver of any ciphertext. As introduced by Kiayias, Tsiounis and Yung (Asiacrypt'07), GE is motivated by applications in the context of oblivious retriever storage systems,
doi:10.1007/978-3-662-53890-6_4
fatcat:24pjz22dxfgldnyd6e53s2yxpi