Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Efficient commitment schemes with bounded sender and unbounded receiver

From MaRDI portal
Publication:1291804
Jump to:navigation, search

DOI10.1007/PL00003821zbMath0936.94011MaRDI QIDQ1291804

Shai Halevi

Publication date: 22 May 2000

Published in: Journal of Cryptology (Search for Journal in Brave)


zbMATH Keywords

factoringcommitment schemesBlum integersclaw-free permutation pairs


Mathematics Subject Classification ID

Cryptography (94A60)


Related Items (2)

Smooth projective hashing and two-message oblivious transfer ⋮ One-round secure comparison of integers




This page was built for publication: Efficient commitment schemes with bounded sender and unbounded receiver

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1291804&oldid=13398635"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 10:44.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki