Advances in Cryptology — EUROCRYPT 2003

No abstract is available for this paper.

• Publication year

  2003

• Venue

  Lecture Notes in Computer Science

• Publication date

  Unknown publication date

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1007/3-540-39200-9
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Efficient signature generation by smart cards

  2004cited by this paper
• Efficient cryptographic protocols preventing man-in-the-middle attacks

  2002influential reference
• Foundations of Cryptography: Basic Tools

  2002influential reference
• Flaws in Applying Proof Methodologies to Signature Schemes

  2002cited by this paper
• Deniable Ring Authentication

  2002influential reference
• Constant-round coin-tossing with a man in the middle or realizing the shared random string model

  2002influential reference
• Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption

  2001influential reference
• REACT: Rapid Enhanced-Security Asymmetric Cryptosystem Transform

  2001cited by this paper
• OAEP Reconsidered

  2001cited by this paper
• Twin signatures: an alternative to the hash-and-sign paradigm

  2001cited by this paper
• Efficient and Non-interactive Non-malleable Commitment

  2001influential reference
• Universally composable security: a new paradigm for cryptographic protocols

  2001influential reference
• Concurrent oblivious transfer

  2000influential reference
• Security of Signed ElGamal Encryption

  2000cited by this paper
• Multiparty Computation from Threshold Homomorphic Encryption

  2000influential reference
• Zaps and their applications

  2000influential reference
• Non-malleable non-interactive zero knowledge and adaptive chosen-ciphertext security

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

  1999cited by this paper
• Public-key cryptography and password protocols: the multi-user case

  1999influential reference
• Concurrent zero-knowledge

  1998influential reference
• A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack

  1998influential reference
• Public-key cryptography and password protocols

  1998influential reference
• Concurrent Zero-Knowledge: Reducing the Need for Timing Constraints

  1998influential reference
• Modular Design of Secure yet Practical Cryptographic Protocols

  1997influential reference
• Lower Bounds for Discrete Logarithms and Related Problems

  1997cited by this paper
• Security Proofs for Signature Schemes

  1996cited by this paper
• Complexity of a determinate algorithm for the discrete logarithm

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

  1994influential reference
• Zero-knowledge proofs of knowledge without interaction

  1992influential reference
• On Defining Proofs of Knowledge

  1992influential reference
• Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack

  1991cited by this paper
• Non-malleable cryptography

  1991influential reference
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems

  1991influential reference
• Fast Signature Generation With a Fiat Shamir-Like Scheme

  1991cited by this paper
• Public-key cryptosystems provably secure against chosen ciphertext attacks

  1990influential reference
• Multiple non-interactive zero knowledge proofs based on a single random string

  1990influential reference
• A fast signature scheme based on congruential polynomial operations

  1990cited by this paper
• Efficient Identification and Signatures for Smart Cards (Abstract)

  1989cited by this paper
• A Practical Zero-Knowledge Protocol Fitted to Security Microprocessor Minimizing Both Transmission and Memory

  1988influential reference
• How to Guess l-th Roots Modulo n by Reducing Lattice Bases

  1988cited by this paper
• How to Break Okamoto's Cryptosystem by Reducing Lattice Bases

  1988cited by this paper
• A Fast Signature Scheme Based on Quadratic Inequalities

  1985cited by this paper
• Symmetric Public-Key Encryption

  1985influential reference
• A public key cryptosystem and a signature scheme based on discrete logarithms

  1984influential reference
• Factoring polynomials with rational coefficients

  1982cited by this paper
• DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION

  1979cited by this paper
• A method for obtaining digital signatures and public-key cryptosystems

  1978cited by this paper
• Über die Verteilung der quadratischen Reste und Nichtreste

  year unknowncited by this paper

• Chinese Style Matching CAPTCHA: Style Matching Technology Based on Deep Learning

  2025cites this paper
• Adaptive CAPTCHA: A CRNN-Based Text CAPTCHA Solver with Adaptive Fusion Filter Networks

  2024cites this paper
• Style matching CAPTCHA: match neural transferred styles to thwart intelligent attacks

  2023cites this paper
• Secure Sharing Sensitive Data Based on Network Coding and Attribute-Based Encryption

  2020cites this paper
• Asymptotically-Good Arithmetic Secret Sharing over Z/(p^\ell Z) with Strong Multiplication and Its Applications to Efficient MPC

  2019cites this paper
• Data security and privacy in the cloud

  2019cites this paper
• History-Free Sequential Aggregate MAC Revisited

  2019cites this paper
• Security Proofs for Protocols Involving Humans

  2016cites this paper
• Gaussian Intrinsic Entanglement.

  2016cites this paper
• Fake It Till You Make It: Reputation, Competition, and Yelp Review Fraud

  2016cites this paper
• Pharmacy Information Systems in Teaching Hospitals: A Multi-dimensional Evaluation Study

  2016cites this paper
• Towards Forward Security Properties for PEKS and IBE

  2015cites this paper
• Securely Measuring the Overlap between Private Datasets with Cryptosets

  2015cites this paper
• A Classical Analog to Entanglement Reversibility

  2015cites this paper
• Limitations on quantum key repeaters

  2014cites this paper
• On Verification of Restricted Extended Affine Equivalence of Vectorial Boolean Functions

  2014cites this paper
• Reversible Secrecy in Classical and Quantum States

  2014influential citation
• FaceCAPTCHA: a CAPTCHA that identifies the gender of face images unrecognized by existing gender classifiers

  2014cites this paper
• SecDSIM: A Framework for Secure Data Storage and Identity Management in the Cloud

  2014cites this paper
• On the degree of completeness of cryptographic functions

  2014cites this paper
• Statistical Analysis and Design of Crowdsourcing Applications

  2014cites this paper
• Verifiable Random Functions: Relations to Identity-Based Key Encapsulation and New Constructions

  2013cites this paper
• A Survey on Nonlinear Boolean Functions with Optimal Algebraic Immunity Suitable for Stream Ciphers

  2013cites this paper
• Learning a Language for Free While Translating the Web. Does Duolingo Work

  2013cites this paper
• Harnessing the Wisdom of Crowds for Corpus Annotation through CAPTCHA

  2013cites this paper
• A hierarchical attribute-based encryption scheme

  2013cites this paper
• CiteSearcher: A Google Scholar frontend for Mobile Devices

  2012cites this paper
• Multi-exponentiation algorithm based on binary GCD computation and its application to side-channel countermeasure

  2012cites this paper
• Can bipartite classical information resources be activated

  2012cites this paper
• On Lai–Massey and quasi-Feistel ciphers

  2011cites this paper
• Development of Undeniable Signature Schemes without Certificates

  2011cites this paper
• Efficient Conversion of Scientific Legacy Documents into Semantic Web Resources: using biosystematics as a working example

  2011cites this paper
• Security on VANETs: Privacy, misbehaving nodes, false information and secure data aggregation

  2011cites this paper
• On Black-Box Complexity and Adaptive, Universal Composability of Cryptographic Tasks

  2011cites this paper
• Identification and construction of Boolean functions with maximum algebraic immunity

  2010cites this paper
• Redundant τ-Adic Expansions II: Non-Optimality and Chaotic Behaviour

  2010cites this paper
• Cryptanalysis of efficient proxy signature schemes for mobile communication

  2010cites this paper
• On designated-weight Boolean functions with highest algebraic immunity

  2010cites this paper
• Construction of Boolean functions with maximum algebraic immunity and count of their annihilators at lowest degree

  2010cites this paper
• On (2m + 1)-variable symmetric Boolean functions with submaximum algebraic immunity 2m−1

  2009cites this paper
• Conjunctive Broadcast and Attribute-Based Encryption

  2009cites this paper
• Multidimensional Extension of Matsui's Algorithm 2

  2009cites this paper
• What's up CAPTCHA?: a CAPTCHA based on image orientation

  2009cites this paper
• The Interrogator as Critic: The Turing Test and the Evaluation of Generative Music Systems

  2009cites this paper
• Improved Mixing Time Bounds for the Thorp Shuffle

  2009cites this paper
• Construction and enumeration of Boolean functions with maximum algebraic immunity

  2009cites this paper
• An Efficient Protocol for Fair Secure Two-Party Computation

  2008cites this paper
• WG: A family of stream ciphers with designed randomness properties

  2008cites this paper
• Towards Black-Box Accountable Authority IBE with Short Ciphertexts and Private Keys

  2008cites this paper
• On the Unprovable Security of 2-Key XCBC

  2008cites this paper
• Privacy Preserving Data Mining within Anonymous Credential Systems

  2008cites this paper
• Hardened Stateless Session Cookies

  2008cites this paper
• Clock-controlled key-stream generator and its cryptographic properties

  2008cites this paper
• Design of a New Stream Cipher-LEX

  2008cites this paper
• Practical identity-based aggregate signature from bilinear maps

  2008cites this paper
• A content-driven access control system

  2008cites this paper
• Experimentally friendly geometrical criteria for entanglement.

  2007cites this paper
• Efficient Committed Oblivious Transfer of Bit Strings

  2007cites this paper
• Signatures pour l'anonymat fondées sur les couplages et applications

  2007cites this paper
• Content-Aware Steganography: About Lazy Prisoners and Narrow-Minded Wardens

  2006cites this paper
• Representation Attacks on the Braid Diffie-Hellman Public Key Encryption

  2006cites this paper
• Symmetric Nonce Respecting Security Model and the MEM Mode of Operation

  2006cites this paper
• GiveALink: mining a semantic network of bookmarks for web search and recommendation

  2005cites this paper
• Advances in Elliptic Curve Cryptography: Cryptography from Pairings

  2005cites this paper
• Related Key Attack

  2005cites this paper
• On Small Characteristic Algebraic Tori in Pairing-Based Cryptography

  2004cites this paper
• Cryptanalysis of a White Box AES Implementation

  2004cites this paper
• A Survey of Public-Key Cryptosystems

  2004cites this paper
• Multipartite Bound Information exists and can be activated

  2003cites this paper