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

Theory of cryptography. Second theory of cryptography conference, TCC 2005, Cambridge, MA, USA, February 10--12, 2005. Proceedings.

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

DOI10.1007/b106171zbMath1069.94500OpenAlexW4251449056WikidataQ59379672 ScholiaQ59379672MaRDI QIDQ2388712

No author found.

Publication date: 20 September 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b106171



Mathematics Subject Classification ID

Proceedings of conferences of miscellaneous specific interest (00B25) Cryptography (94A60) Proceedings, conferences, collections, etc. pertaining to information and communication theory (94-06)


Related Items (5)

How to re-use a one-time pad safely and almost optimally even if \(\mathrm P=\mathrm{NP}\) ⋮ Improved Cryptographic Puzzle Based on Modular Exponentiation ⋮ Reconciling non-malleability with homomorphic encryption ⋮ New Communication-Efficient Oblivious Transfer Protocols Based on Pairings ⋮ On Basing Private Information Retrieval on NP-Hardness






This page was built for publication: Theory of cryptography. Second theory of cryptography conference, TCC 2005, Cambridge, MA, USA, February 10--12, 2005. Proceedings.

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