Advances in Cryptology - ASIACRYPT 2003

DOI10.1007/b94617zbMath1205.68165OpenAlexW2899867281MaRDI QIDQ5902396

Helger Lipmaa

Publication date: 5 January 2010

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

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

zbMATH Keywords

statistical zero knowledgearguments of knowledgeDiophantine complexityinteger commitment scheme

Mathematics Subject Classification ID

Cryptography (94A60) Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Authentication, digital signatures and secret sharing (94A62)

Related Items (28)

Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting ⋮ Issuer-hiding attribute-based credentials ⋮ Efficient Non-interactive Range Proof ⋮ Rational Modular Encoding in the DCR Setting: Non-interactive Range Proofs and Paillier-Based Naor-Yung in the Standard Model ⋮ On server trust in private proxy auctions ⋮ Zero-knowledge arguments for subverted RSA groups ⋮ Efficient RSA key generation and threshold Paillier in the two-party setting ⋮ Flashproofs: efficient zero-knowledge arguments of range and polynomial evaluation with transparent setup ⋮ Inner product functional commitments with constant-size public parameters and openings ⋮ Zero-knowledge range arguments for signed fractional numbers from lattices ⋮ Succinct Diophantine-satisfiability arguments ⋮ Diophantine hierarchy ⋮ Dory: efficient, transparent arguments for generalised inner products and polynomial commitments ⋮ Several cryptographic applications of \(\Sigma\)-protocol ⋮ Secure Authenticated Comparisons ⋮ Removing the Strong RSA Assumption from Arguments over the Integers ⋮ Efficient Binary Conversion for Paillier Encrypted Values ⋮ Efficient Protocols for Set Membership and Range Proofs ⋮ Fast secure two-party ECDSA signing ⋮ Zero-Knowledge Authenticated Order Queries and Order Statistics on a List ⋮ A General, Flexible and Efficient Proof of Inclusion and Exclusion ⋮ Transparent SNARKs from DARK compilers ⋮ Efficient range proofs with transparent setup from bounded integer commitments ⋮ A Secure and Efficient Proof of Integer in an Interval Range ⋮ Encryption Switching Protocols ⋮ Efficient, Robust and Constant-Round Distributed RSA Key Generation ⋮ Efficiency Limitations for Σ-Protocols for Group Homomorphisms ⋮ Sanitizable Signatures Revisited

This page was built for publication: Advances in Cryptology - ASIACRYPT 2003