Fully Anonymous Attribute Tokens from Lattices-Reference-Cited by-同舟云学术

Fully Anonymous Attribute Tokens from Lattices

Published:2012 Issue: Volume: Page:57-75
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Camenisch Jan,Neven Gregory,Rückert Markus

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-32928-9_4

Reference48 articles.

1. Lecture Notes in Computer Science;G. Ateniese,2000

2. Ajtai, M.: Generating hard instances of lattice problems (extended abstract). In: STOC 1996. ACM (1996)

3. Alwen, J., Peikert, C.: Generating shorter bases for hard random lattices. In: STACS 2009. Dagstuhl Seminar Proceedings, vol. 09001, Schloss Dagstuhl (2009)

4. Lecture Notes in Computer Science;G. Ateniese,2003

5. Babai, L.: On Lovász’ lattice reduction and the nearest lattice point problem. Combinatorica 6(1), 1–13 (1986)

Cited by 61 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Lattice-based dynamic universal accumulator: Design and application;Computer Standards & Interfaces;2024-04

2. Post-Quantum Cryptography Research Landscape: A Scientometric Perspective;Journal of Computer Information Systems;2023-09-29

3. Zero-Knowledge Arguments for Lattice-Based Accumulators: Logarithmic-Size Ring Signatures and Group Signatures Without Trapdoors;Journal of Cryptology;2023-05-25

4. A survey of quantum secure group signature schemes: Lattice-based approach;Journal of Information Security and Applications;2023-03

5. Dynamic group signature scheme using ideal lattices;International Journal of Information and Computer Security;2023