Floppy-Sized Group Signatures from Lattices
| Autor: | Cecilia Boschini, Jan Camenisch, Gregory Neven |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2018 |
| Předmět: |
Theoretical computer science
Computer science business.industry Proof of knowledge 020206 networking & telecommunications Cryptography 02 engineering and technology Group signature USable Mathematical proof Encryption Public-key cryptography Lattices Group Signature Lattice (order) 0202 electrical engineering electronic engineering information engineering Verifiable Encryption 020201 artificial intelligence & image processing business public-key cryptography |
| Zdroj: | Lecture Notes in Computer Science Lecture Notes in Computer Science-Applied Cryptography and Network Security Applied Cryptography and Network Security ISBN: 9783319933863 ACNS Applied Cryptography and Network Security |
| ISSN: | 0302-9743 1611-3349 |
| Popis: | We present the first lattice-based group signature scheme whose cryptographic artifacts are of size small enough to be usable in practice: for a group of225225users, signatures take 910 kB and public keys are 501 kB. Our scheme builds upon two recently proposed lattice-based primitives: the verifiable encryption scheme by Lyubashevsky and Neven (Eurocrypt 2017) and the signature scheme by Boschini, Camenisch, and Neven (IACR ePrint 2017). To achieve such short signatures and keys, we first re-define verifiable encryption to allow one to encrypt a function of the witness, rather than the full witness. This definition enables more efficient realizations of verifiable encryption and is of independent interest. Second, to minimize the size of the signatures and public keys of our group signature scheme, we revisit the proof of knowledge of a signature and the proofs in the verifiable encryption scheme provided in the respective papers. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|