Proving possession of arbitrary secrets while not giving them away: New protocols and a proof in GNY logic

DOI10.1007/S11229-005-3879-4MaRDI QIDQ2500832zbMATH OpenOpenAlexFDO

Authors Wouter Teepe

Publication date 18 August 2006

Published in Synthese (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11229-005-3879-4

zbMATH Keywords

authentication logiczero-knowledge protocols

Mathematics Subject Classification ID

Logic in computer science (03B70) Applications of game theory (91A80) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• scientific article; zbMATH DE number 4057443
• scientific article; zbMATH DE number 883898
• Zero-knowledge proofs of knowledge for group homomorphisms
• scientific article; zbMATH DE number 4041785
• scientific article; zbMATH DE number 1406779

Cites work

• A fair and efficient solution to the socialist millionaires' problem
• A semantics for a logic of authentication (extended abstract)
• Advances in Cryptology - EUROCRYPT 2004
• Equivalence between Semantic Security and Indistinguishability against Chosen Ciphertext Attacks
• scientific article; zbMATH DE number 4191108 (Why is no real title available?)
• scientific article; zbMATH DE number 4057439 (Why is no real title available?)
• scientific article; zbMATH DE number 708820 (Why is no real title available?)
• scientific article; zbMATH DE number 1030977 (Why is no real title available?)
• scientific article; zbMATH DE number 1030978 (Why is no real title available?)
• scientific article; zbMATH DE number 1775397 (Why is no real title available?)
• scientific article; zbMATH DE number 2087350 (Why is no real title available?)
• scientific article; zbMATH DE number 854547 (Why is no real title available?)
• scientific article; zbMATH DE number 2196514 (Why is no real title available?)
• Keyed hash functions
• Oblivious transfer and polynomial evaluation
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
• Proving without knowing: on oblivious, agnostic and blindfolded provers
• The knowledge complexity of interactive proof-systems
• The Russian cards problem

Cited in

(4)

• Learning to apply theory of mind
• Minimum disclosure proofs of knowledge
• scientific article; zbMATH DE number 1302806 (Why is no real title available?)
• Secrecy Logic: Protoalgebraic S-Secrecy Logics

This page was built for publication: Proving possession of arbitrary secrets while not giving them away: New protocols and a proof in GNY logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2500832)