skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


  • Home
  • Search Results
  • Page 1 of 4

Search for: All records

Award ID contains: 2107187

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. ; ; ; ; (, ACM)
    Free, publicly-accessible full text available June 15, 2026
  2. ; ; ; (, Advances in Cryptology - {EUROCRYPT} 2025 - 44th Annual International Conference on the Theory and Applications of Cryptographic Techniques)
    Free, publicly-accessible full text available May 4, 2026
  3. ; ; ; ; ; ; (, Society for Industrial and Applied Mathematics)
    Free, publicly-accessible full text available January 1, 2026
  4. ; ; ; ; (, Society for Industrial and Applied Mathematics)
    Free, publicly-accessible full text available January 1, 2026
  5. ; ; (, Schloss Dagstuhl – Leibniz-Zentrum für Informatik)
    Böhme, Rainer; Kiffer, Lucianna (Ed.)
    We propose Cornucopia, a protocol framework for distributed randomness beacons combining accumulators and verifiable delay functions. Cornucopia generalizes the Unicorn protocol, using an accumulator to enable efficient verification by each participant that their contribution has been included. The output is unpredictable as long as at least one participant is honest, yielding a scalable distributed randomness beacon with strong security properties. Proving this approach secure requires developing a novel property of accumulators, insertion security, which we show is both necessary and sufficient for Cornucopia-style protocols. We show that not all accumulators are insertion-secure, then prove that common constructions (Merkle trees, RSA accumulators, and bilinear accumulators) are either naturally insertion-secure or can be made so with trivial modifications. 
    more » « less
    Full Text Available 
  6. ; (, 44th Annual International Cryptology Conference)
    Accepted Manuscript Full Text Available
  7. ; ; ; (, ACM)
    Full Text Available 
  8. ; ; (, ACM)
    Full Text Available 
  9. ; ; (, ACM)
    Full Text Available 
  10. ; (, ACM)
    Full Text Available