Simplified Submission of Inputs to Protocols

DOI10.1007/978-3-540-85855-3_20MaRDI QIDQ3540053zbMATH OpenOpenAlexFDO

Authors Douglas Wikström

Publication date 20 November 2008

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

Full work available at URL https://doi.org/10.1007/978-3-540-85855-3_20

Mathematics Subject Classification ID

Network protocols (68M12) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• scientific article; zbMATH DE number 1406797
• scientific article; zbMATH DE number 1504554
• Theory of Cryptography
• Verifiable elections that scale for free
• A homomorphic encryption-based secure electronic voting scheme

Cites work

• A public key cryptosystem and a signature scheme based on discrete logarithms
• A Sender Verifiable Mix-Net and a New Proof of a Shuffle
• An Adaptively Secure Mix-Net Without Erasures
• An Efficient threshold Public Key Cryptosystem Secure Against Adaptive Chosen Ciphertext Attack (Extended Abstract)
• scientific article; zbMATH DE number 176545 (Why is no real title available?)
• scientific article; zbMATH DE number 176565 (Why is no real title available?)
• scientific article; zbMATH DE number 1302835 (Why is no real title available?)
• scientific article; zbMATH DE number 2081074 (Why is no real title available?)
• scientific article; zbMATH DE number 1775406 (Why is no real title available?)
• scientific article; zbMATH DE number 2086698 (Why is no real title available?)
• scientific article; zbMATH DE number 1842502 (Why is no real title available?)
• Non-interactive Distributed-Verifier Proofs and Proving Relations among Commitments
• Perfect Non-interactive Zero Knowledge for NP
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Rerandomizable RCCA Encryption
• Securing threshold cryptosystems against chosen ciphertext attack
• Simplified Submission of Inputs to Protocols
• The Knowledge Complexity of Interactive Proof Systems
• Theory of Cryptography
• Theory of Cryptography
• Theory of Cryptography
• Theory of Cryptography
• Topics in Cryptology – CT-RSA 2006

Cited in

(6)

• NM-CPA secure encryption with proofs of plaintext knowledge
• Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model
• Simplified universal composability framework
• Simplified Submission of Inputs to Protocols
• Traceable receipt-free encryption
• End-to-End Verifiable Quadratic Voting with Everlasting Privacy

This page was built for publication: Simplified Submission of Inputs to Protocols

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