Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

97

STOC
2007
ACM

116views Algorithms» more STOC 2007»

Statistically-hiding commitment from any one-way function

16 years 3 months ago

Statistically-hiding commitment from any one-way function

Download crypto.cs.mcgill.ca

Iftach Haitner, Omer Reingold

Real-time Traffic

Algorithms | Statistically-hiding Commitment | STOC 2007 |

claim paper

Related Content

» OneWay Permutations Interactive Hashing and Statistically Hiding Commitments

» Universal OneWay Hash Functions via Inaccessible Entropy

» ConstantRound Nonmalleable Commitments from Subexponential OneWay Functions

» Perfectly Concealing Quantum Bit Commitment from any Quantum OneWay Permutation

» Statistical ZeroKnowledge Arguments for NP from Any OneWay Function

» Candidate OneWay Functions Based on Expander Graphs

» Reducing Complexity Assumptions for StatisticallyHiding Commitment

» Concurrent Statistical ZeroKnowledge Arguments for NP from One Way Functions

» Efficiency Improvements in Constructing Pseudorandom Generators from OneWay Functions

» Foundations of Nonmalleable Hash and OneWay Functions

Post Info
More Details (n/a)

Added	03 Dec 2009
Updated	03 Dec 2009
Type	Conference
Year	2007
Where	STOC
Authors	Iftach Haitner, Omer Reingold

Comments (0)