Reducing Complexity Assumptions for Statistically-Hiding Commitment

Lecture Notes in Computer Science - Germany
doi 10.1007/11426639_4
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Analysing the Efficiency of the Packet Hiding Methods Based on the Strong Hiding Commitment Scheme (SHCS)

International Journal of Computer Applications
2013English

Statistically Hiding Commitments and Statistical Zero-Knowledge Arguments From Any One-Way Function

SIAM Journal on Computing
MathematicsComputer Science
2009English

Another Motivation for Reducing the Randomness Complexity of Algorithms

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

Reducing Computational Complexity in Fingerprint Matching

Turkish Journal of Electrical Engineering and Computer Sciences
Electronic EngineeringElectricalComputer Science
2020English

Reducing Kernel Development Complexity in Distributed Environments

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
English

Reducing Labeling Complexity in Streaming Data Mining

English

Universal Alcohol/Drug Screening in Prenatal Care: A Strategy for Reducing Racial Disparities? Questioning the Assumptions

Maternal and Child Health Journal
Child HealthEpidemiologyGynecologyPublic HealthPerinatologyEnvironmentalObstetricsPediatricsOccupational Health
2010English

Reducing Design Complexity of the Load/Store Queue

English

Graph Sampling Approach for Reducing Computational Complexity of Large-Scale Social Network

Journal of Innovative Technology and Education
2016English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy