Verifiable Random Functions From Weaker Assumptions

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-662-46497-7_5
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Random Tessellations and Boolean Random Functions

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013English

Random Matrices andL-functions

Journal of Physics A: Mathematical and General
2003English

Verifiable Voting Systems

2013English

Random LSC Functions: An Ergodic Theorem

Mathematics of Operations Research
Management ScienceComputer Science ApplicationsOperations ResearchMathematics
2001English

Random Indexing Using Statistical Weight Functions

2006English

Vital Verifiable CPD – Instructions

Vital
2009English

Witness Encryption From Instance Independent Assumptions

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Polar Functions for Anisotropic Gaussian Random Fields

Abstract and Applied Analysis
Applied MathematicsAnalysis
2014English

Zeros of Random Functions in Bergman Spaces

Annales de l'Institut Fourier
GeometryTopologyNumber TheoryAlgebra
1979English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy