Simplified Submission of Inputs to Protocols

DOI10.1007/978-3-540-85855-3_20zbMath1180.94065MaRDI QIDQ3540053

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

94A60: Cryptography

68M12: Network protocols

94A62: Authentication, digital signatures and secret sharing

Related Items

Traceable receipt-free encryption, End-to-End Verifiable Quadratic Voting with Everlasting Privacy, Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model, Simplified Universal Composability Framework, Simplified Submission of Inputs to Protocols

Cites Work

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