A Framework for Practical Universally Composable Zero-Knowledge Protocols

No abstract is available for this paper.

• Publication year

  2011

• Venue

  IACR Cryptology ePrint Archive

• Publication date

  2011-12-04

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1007/978-3-642-25385-0_24
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Highly-Efficient Universally-Composable Commitments based on the DDH Assumption

  2011cited by this paper
• Credential Authenticated Identification and Key Exchange

  2010influential reference
• The Group of Signed Quadratic Residues and Applications

  2009cited by this paper
• A framework for universally composable non-committing blind signatures

  2009cited by this paper
• On the Portability of Generalized Schnorr Proofs

  2009influential reference
• Universally Composable Symmetric Encryption

  2009cited by this paper
• Threshold Homomorphic Encryption in the Universally Composable Cryptographic Library

  2008cited by this paper
• Universally Composable Undeniable Signature

  2008cited by this paper
• Efficient Constructions of Composable Commitments and Zero-Knowledge Proofs

  2008cited by this paper
• Universally Composable Security with Global Setup

  2007cited by this paper
• The reactive simulatability (RSIM) framework for asynchronous systems

  2007cited by this paper
• Universally Composable Key-Evolving Signature

  2007cited by this paper
• Protocols for Bounded-Concurrent Secure Two-Party Computation

  2006cited by this paper
• Universally Composable Identity-Based Encryption

  2006cited by this paper
• HMQV: A High-Performance Secure Diffie-Hellman Protocol

  2005cited by this paper
• Tracing-by-Linking Group Signatures

  2005cited by this paper
• On the Security of Nominative Signatures

  2005cited by this paper
• Relaxing Environmental Security: Monitored Functionalities and Client-Server Computation

  2005cited by this paper
• An Efficient Online Electronic Cash with Unlinkable Exact Payments

  2005cited by this paper
• Short Linkable Ring Signatures for E-Voting, E-Cash and Attestation

  2005cited by this paper
• Untraceable secret credentials: trust establishment with privacy

  2004cited by this paper
• Signature Schemes and Anonymous Credentials from Bilinear Maps

  2004cited by this paper
• On Simulation-Sound Trapdoor Commitments

  2004influential reference
• Cryptography: An Introduction

  2004cited by this paper
• Direct anonymous attestation

  2004cited by this paper
• Signature Bouquets: Immutability for Aggregated/Condensed Signatures

  2004cited by this paper
• New notions of security: achieving universal composability without trusted setup

  2004cited by this paper
• Group Signatures with Separate and Distributed Authorities

  2004cited by this paper
• Separable Linkable Threshold Ring Signatures

  2004cited by this paper
• History-Based Signature or How to Trust Anonymous Documents

  2004cited by this paper
• Strengthening Zero-Knowledge Protocols Using Signatures

  2003cited by this paper
• On Diophantine Complexity and Statistical Zero-Knowledge Arguments

  2003influential reference
• Practical Verifiable Encryption and Decryption of Discrete Logarithms

  2003cited by this paper
• Bounded-concurrent secure two-party computation without setup assumptions

  2003cited by this paper
• Bounded-concurrent secure two-party computation in a constant number of rounds

  2003cited by this paper
• A Verifiable Secret Sharing Scheme with Statistical zero-knowledge

  2003cited by this paper
• Universal Composition with Joint State

  2003cited by this paper
• On the Anonymity of Fair Offline E-cash Systems

  2003cited by this paper
• Design and implementation of the idemix anonymous credential system

  2002cited by this paper
• Quasi-Efficient Revocation in Group Signatures

  2002cited by this paper
• Universally composable two-party and multi-party secure computation

  2002cited by this paper
• A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order

  2002cited by this paper
• Security Analysis of IKE's Signature-Based Key-Exchange Protocol

  2002cited by this paper
• Two-party generation of DSA signatures

  2001cited by this paper
• Universally composable security: a new paradigm for cryptographic protocols

  2001influential reference
• Practical forward secure group signature schemes

  2001cited by this paper
• Efficient Revocation in Group Signatures

  2001cited by this paper
• Composition and integrity preservation of secure reactive systems

  2000cited by this paper
• Adaptively Secure Threshold Cryptography: Introducing Concurrency, Removing Erasures

  2000influential reference
• Efficient Proofs that a Committed Number Lies in an Interval

  2000cited by this paper
• How to Prove That a Committed Number Is Prime

  1999cited by this paper
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes

  1999cited by this paper
• Group Blind Digital Signatures: A Scalable Solution to Electronic Cash

  1998cited by this paper
• A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack

  1998cited by this paper
• Zero-Knowledge Proofs for Finite Field Arithmetic; or: Can Zero-Knowledge be for Free?

  1998cited by this paper
• Rapid Demonstration of Linear Relations Connected by Boolean Operators

  1997cited by this paper
• Modular Design of Secure yet Practical Cryptographic Protocols

  1997cited by this paper
• Zero-Knowledge Proofs for Finite Field Arithmetic or: Can Zero-Knowledge be for Free?

  1997cited by this paper
• Statistical Zero Knowledge Protocols to Prove Modular Polynomial Relations

  1997cited by this paper
• Efficient Group Signature Schemes for Large Groups (Extended Abstract)

  1997cited by this paper
• Stronger Security Proofs for RSA and Rabin Bits

  1997cited by this paper
• Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols

  1994cited by this paper
• On Defining Proofs of Knowledge

  1992cited by this paper
• Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing

  1991cited by this paper
• The Knowledge Complexity of Interactive Proof Systems

  1989cited by this paper
• Randomized algorithms in number theory

  1985cited by this paper
• SRI International

  1982cited by this paper

• Universally Composable Adaptor Signatures

  2025influential citation
• Universally Composable Termination Analysis of Tendermint

  2025cites this paper
• Towards Source Mapping for Zero-Knowledge Smart Contracts: Design and Preliminary Evaluation

  2025cites this paper
• A lattice-based privacy-preserving decentralized multi-party payment scheme

  2025cites this paper
• PACDAM: Privacy-Preserving and Adaptive Cross-Chain Digital Asset Marketplace

  2024cites this paper
• Accio: Variable-Amount, Optimized-Unlinkable and NIZK-Free Off-Chain Payments via Hubs

  2023cites this paper
• MPC for Group Reconstruction Circuits

  2022cites this paper
• Universal Atomic Swaps: Secure Exchange of Coins Across All Blockchains

  2022cites this paper
• Foundations of Coin Mixing Services

  2022cites this paper
• GMHL: Generalized Multi-Hop Locks for Privacy-Preserving Payment Channel Networks

  2022cites this paper
• Concise UC Zero-Knowledge Proofs for Oblivious Updatable Databases

  2021influential citation
• Hashing to Prime in Zero-Knowledge

  2021cites this paper
• Cerebro: A Platform for Multi-Party Cryptographic Collaborative Learning

  2021cites this paper
• Almost-Asynchronous MPC under Honest Majority, Revisited

  2021cites this paper
• Unlinkable Updatable Hiding Databases and Privacy-Preserving Loyalty Programs

  2021influential citation
• Lockable Signatures for Blockchains: Scriptless Scripts for All Signatures

  2021cites this paper
• Fair Data Transactions Across Private Databases

  2020cites this paper
• Universally Composable Accumulators

  2020cites this paper
• Sharing without Showing: Building Secure Collaborative Systems

  2020cites this paper
• Vision: A Critique of Immunity Passports and W3C Decentralized Identifiers

  2020cites this paper
• Security Standardisation Research: 6th International Conference, SSR 2020, London, UK, November 30 – December 1, 2020, Proceedings

  2020cites this paper
• Unlinkable Updatable Databases and Oblivious Transfer with Access Control

  2020influential citation
• UC Updatable Databases and Applications

  2020cites this paper
• Progress in Cryptology - AFRICACRYPT 2020: 12th International Conference on Cryptology in Africa, Cairo, Egypt, July 20 – 22, 2020, Proceedings

  2020cites this paper
• ALBATROSS: publicly AttestabLe BATched Randomness based On Secret Sharing

  2020cites this paper
• Multi-Protocol UC and its Use for Building Modular and Efficient Protocols

  2019cites this paper
• UC Updatable Non-Hiding Committed Database with Efficient Zero-Knowledge Proofs

  2019cites this paper
• ROYALE: A Framework for Universally Composable Card Games with Financial Rewards and Penalties Enforcement

  2019cites this paper
• Weak Compression and (In)security of Rational Proofs of Storage

  2018cites this paper
• Efficient Fully Structure-Preserving Signatures and Shrinking Commitments

  2018cites this paper
• Efficient Fully Structure-Preserving Signatures and Shrinking Commitments

  2018cites this paper
• Personal and Password-Based Cryptography

  2018cites this paper
• Off-chain protocols for cryptocurrencies

  2018cites this paper
• Using Level-1 Homomorphic Encryption to Improve Threshold DSA Signatures for Bitcoin Wallet Security

  2017cites this paper
• Privacy for Distributed Databases via (Un)linkable Pseudonyms

  2017cites this paper
• Computational Independence in the Design of Cryptographic Protocols

  2016cites this paper
• Threshold-Optimal DSA/ECDSA Signatures and an Application to Bitcoin Wallet Security

  2016cites this paper
• How to Obtain Fully Structure-Preserving (Automorphic) Signatures from Structure-Preserving Ones

  2016cites this paper
• Privacy in Location-Based Services

  2016cites this paper
• Composable and Modular Anonymous Credentials: Definitions and Practical Constructions

  2015cites this paper
• Can universally composable cryptographic protocols be practical

  2015cites this paper
• Kerckhoff ’ s Institute IRMA Verified Assurer Securely storing identity document chip data onto IRMA cards

  2015cites this paper
• Computational Soundness for Interactive Primitives

  2015cites this paper
• Two-Server Password-Authenticated Secret Sharing UC-Secure Against Transient Corruptions

  2015cites this paper
• Fully Structure-Preserving Signatures and Shrinking Commitments

  2015cites this paper
• Practical privacy-preserving location-sharing based services with aggregate statistics

  2014cites this paper
• Advances in Cryptology – ASIACRYPT 2015

  2014influential citation
• Memento: How to Reconstruct Your Secrets from a Single Password in a Hostile Environment

  2014cites this paper
• Privacy-enhanced identity management: from cryptography to practice

  2014cites this paper
• Data and Applications Security and Privacy XXVII

  2013cites this paper
• New Techniques for SPHFs and Efficient One-Round PAKE Protocols

  2013cites this paper
• Zero-knowledge using garbled circuits: how to prove non-algebraic statements efficiently

  2013cites this paper
• Trapdoor Smooth Projective Hash Functions

  2013cites this paper
• Universally composable adaptive oblivious transfer (with access control) from standard assumptions

  2013cites this paper
• Efficient UC-Secure Authenticated Key-Exchange for Algebraic Languages

  2013cites this paper
• Optimally private access control

  2013influential citation
• Practical and Employable Protocols for UC-Secure Circuit Evaluation over ℤn

  2013cites this paper
• Fair Private Set Intersection with a Semi-trusted Arbiter

  2013cites this paper
• Selective Disclosure in Datalog-Based Trust Management

  2013cites this paper
• Practical yet universally composable two-server password-authenticated secret sharing

  2012cites this paper
• Preuves de connaissances interactives et non-interactives

  2012cites this paper
• A New Look at Composition of Authenticated Byzantine Generals

  2012cites this paper
• Private Client-Side Profiling with Random Forests and Hidden Markov Models

  2012influential citation
• Structure Preserving CCA Secure Encryption and Its Application to Oblivious Third Parties

  2011cites this paper
• Structure Preserving CCA Secure Encryption and Applications

  2011cites this paper