all InfoSec news
Trustless unknown-order groups. (arXiv:2211.16128v1 [cs.CR])
Web: http://arxiv.org/abs/2211.16128
Nov. 30, 2022, 2:10 a.m. | Samuel Dobson, Steven Galbraith, Benjamin Smith (GRACE)
cs.CR updates on arXiv.org arxiv.org
Groups of unknown order are of major interest due to their applications
including time-lock puzzles, verifiable delay functions, and accumulators. In
this paper we focus on trustless setup: in this setting, the most popular
unknown-order group construction is ideal class groups of imaginary quadratic
fields.We argue that the full impact of Sutherland's generic group-order
algorithm has not been recognised in this context, and show that group sizes
currently being proposed in practice (namely, approximately 830 bits) do not
meet the …
More from arxiv.org / cs.CR updates on arXiv.org
Latest InfoSec / Cybersecurity Jobs
Penetration Testers - Red Team ICS/OT and Network Experience
@ Waterleaf International LLC | Florida
Chief Information Security Officer
@ Los Angeles Unified School District | Los Angeles
Cybersecurity Engineer
@ Apercen Partners LLC | Folsom, CA
IDM Sr. Security Developer
@ The Ohio State University | Columbus, OH, United States
IT Security Engineer
@ Stylitics | New York City
Information Security Engineer
@ VDA Labs | Remote
Red Team Security Engineer
@ Keeper Security, Inc. | United States - Remote
2023 Security Operations Internship
@ Censys | Ann Arbor, Michigan, United States
Cloud Support Engineer - Security, WFH/In-Office, Mandarin Speaker
@ Amazon.com | Taipei City, TWN
SC2023-002701 IT Analyst- Cloud-Based Ext. Attack Surface Mgmt. (NS)- TUE 21 FEB
@ EMW, Inc. | Mons, Wallonia, Belgium
Cyber Security Consultant
@ Eurofins | Haarlem, Netherlands
Crisis & Cyber Security Management Senior Analyst
@ NielsenIQ | Madrid, Spain