Practical covert authentication

DOI10.1007/978-3-642-54631-0_35MaRDI QIDQ5402996zbMATH OpenOpenAlexFDO

Authors Stanislaw Jarecki

Publication date 25 March 2014

Published in Public-Key Cryptography – PKC 2014 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-54631-0_35

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Covert authentication from lattices
• Covert two-party computation
• Efficient covert two-party computation
• On the round complexity of covert computation
• Covert security with public verifiability: faster, leaner, and simpler

Cited in

(7)

• Short concurrent covert authenticated key exchange (short cAKE)
• On the round complexity of covert computation
• Implicit zero-knowledge arguments and applications to the malicious setting
• Private Mutual Authentication and Conditional Oblivious Transfer
• From Passive to Covert Security at Low Cost
• Practical witness encryption for algebraic languages or how to encrypt under Groth-Sahai proofs
• Covert authentication from lattices

This page was built for publication: Practical covert authentication

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