Demo Data from VLDB 2026 / reviewers in the wild / expert
Sandeep S. Kumar
dblp:45/5218
· DBLP profile ↗
16ranked-venue papers
6as first author
0since 2021 · last 2015
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 7 · 4 first-authorSecurity and privacy · 5 · 2 first-authorComputer networks · 3
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Network and information security
3 papers |
Cryptographic primitives and cryptanalysis · 59% Hardware security and side channels · 41% | |
| Computer architecture, parallel and distributed computing, and storage systems
2 papers |
Integrated circuit design · 77% Reconfigurable computing and FPGAs · 12% Parallel and multicore computing · 12% |
Topics — the 8 heaviest of 12, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Hardware security and side channels
intellectual property protection |
0.1 | 1 | 2007 | FPGA Intrinsic PUFs and Their Use for IP Protection · CHES 2007 |
Hardware security and side channels › hardware security primitives
physical unclonable function |
0.1 | 1 | 2007 | FPGA Intrinsic PUFs and Their Use for IP Protection · CHES 2007 |
Cryptographic primitives and cryptanalysis › public-key cryptography
elliptic curve cryptography |
0.1 | 1 | 2006 | Optimum Digit Serial GF(2^m) Multipliers for Curve-Based Cryptography · IEEE Trans. Computers 2006 |
Cryptographic primitives and cryptanalysis › generic attacks
exhaustive key search |
0.1 | 1 | 2006 | Breaking Ciphers with COPACOBANA - A Cost-Optimized Parallel Code Breaker · CHES 2006 |
Cryptographic primitives and cryptanalysis › cryptographic implementation
hardware implementation |
0.1 | 1 | 2006 | Optimum Digit Serial GF(2^m) Multipliers for Curve-Based Cryptography · IEEE Trans. Computers 2006 |
Integrated circuit design
digital circuit design |
0.1 | 1 | 2006 | Optimum Digit Serial GF(2^m) Multipliers for Curve-Based Cryptography · IEEE Trans. Computers 2006 |
Integrated circuit design
finite field arithmetic |
0.1 | 1 | 2006 | Optimum Digit Serial GF(2^m) Multipliers for Curve-Based Cryptography · IEEE Trans. Computers 2006 |
Cryptographic primitives and cryptanalysis › public-key cryptography › elliptic curve cryptography
hyperelliptic curve cryptography |
0.0 | 1 | 2006 | Optimum Digit Serial GF(2^m) Multipliers for Curve-Based Cryptography · IEEE Trans. Computers 2006 |
Methods — techniques the papers use, named apart from their topics
time-area product evaluation · 0.1n-accumulator multiplier · 0.1double accumulator multiplier · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2015 | Secure indoor positioning: Relay attacks and mitigation using presence sensing systemsabstractSecure indoor positioning is critical to successful adoption of location-based services in buildings. However, positioning based on off-the-air signal measurements is prone to various security threats. In this paper, we provide an overview of security threats encountered in such indoor positioning systems, and particularly focus on the relay threat. In a relay attack, a malicious entity may gain unauthorized access by introducing a rogue relay device in a zone of interest, which is then validly positioned by the location network, and then transfer the control rights to a malicious device outside the zone. This enables the malicious entity to gain access to the application network using the rogue device. We present multiple solutions relying on a presence sensing system to deal with this attack scenario. In one solution, a localized presence sensing system is used to validate the user presence in the vicinity of the position before location-based control is allowed. In another solution, the user device is required to respond to a challenge by a physical action that may be observed and validated by the presence sensing system. Sandeep S. Kumar, Ashish Pandharipande |
INDIN | 1 |
| 2014 | Securing the Internet of Things: A Standardization PerspectiveabstractThe Internet of Things (IoT) is the next wave of innovation that promises to improve and optimize our daily life based on intelligent sensors and smart objects working together. Through Internet Protocol (IP) connectivity, devices can now be connected to the Internet, thus allowing them to be read, controlled, and managed at any time and at any place. Security is an important aspect for IoT deployments. However, proprietary security solutions do not help in formulating a coherent security vision to enable IoT devices to securely communicate with each other in an interoperable manner. This paper gives an overview of the efforts in the Internet Engineering Task Force (IETF) to standardize security solutions for the IoT ecosystem. We first provide an in-depth review of the communication security solutions for IoT, specifically the standard security protocols to be used in conjunction with the Constrained Application Protocol (CoAP), an application protocol specifically tailored to the needs of adapting to the constraints of IoT devices. Since Datagram Transport Layer Security (DTLS) has been chosen as the channel security underneath CoAP, this paper also discusses the latest standardization efforts to adapt and enhance the DTLS for IoT applications. This includes the use of 1) raw public key in DTLS; 2) extending DTLS record Layer to protect group (multicast) communication; and 3) profiling DTLS for reducing the size and complexity of implementations on embedded devices. We also provide an extensive review of compression schemes that are being proposed in IETF to mitigate message fragmentation issues in DTLS. Sye Loong Keoh, Sandeep S. Kumar, Hannes Tschofenig |
IEEE Internet Things J. | 2 |
| 2013 | Securing the IP-based internet of things with HIP and DTLSabstractThe IP-based Internet of Things (IoT) refers to the pervasive interaction of smart devices and people enabling new applications by means of new IP protocols such as 6LoWPAN and CoAP. Security is a must, and for that we need a secure architecture in which all device interactions are protected, from joining an IoT network to the secure management of keying materials. However, this is challenging because existing IP security protocols do not offer all required functionalities and typical Internet solutions do not lead to the best performance. Óscar García-Morchón, Sye Loong Keoh, Sandeep S. Kumar, Pedro Moreno-Sanchez, Francisco Vidal-Meca, Jan Henrik Ziegeldorf |
WISEC | 3 |
| 2012 | End-to-End Transport Security in the IP-Based Internet of ThingsabstractThe IP-based Internet of Things refers to the interconnection of smart devices in a Low-power and Lossy Network (LLN) with the Internet by means of protocols such as 6LoWPAN or CoAP. The mechanisms to protect the LLN from attacks from the Internet and provisioning of an end-to-end (E2E) secure connection are key requirements for functionalities ranging from network access to software updates. Interconnecting such resource constrained devices with high-performance machines requires new security mechanisms that cannot be covered by already known solutions. This paper describes attacks at transport layer against the LLN launched from the Internet. It also introduces approaches to ensure E2E security between two devices located in homogeneous networks using either HTTP/TLS or CoAP/DTLS by proposing a mapping between TLS and DTLS. Martina Brachmann, Sye Loong Keoh, Óscar García-Morchón, Sandeep S. Kumar |
ICCCN | 4 |
| 2010 | Anonymous Social Stamps - Authenticating Anonymous Statements to Friends with Privacy
Sandeep S. Kumar |
SECRYPT | 1 |
| 2009 | Physical Unclonable Functions and Their Applications to Vehicle System SecurityabstractIn recent years, there has been a tremendous increase in the usage of IT based systems in vehicles, with predictions that in the near future, more than 90% of innovations in the automotive sector will be centered on IT software and hardware. However, innovation also means that intellectual property (IP) is created, which is valuable to third (potentially) untrusted and malicious parties. In particular, automobiles are already suffering from security issues, such as illegal copying of software IP, counterfeiting of electronic components, illegal tampering with digital data inside the electronic control units (ECUs), etc. Recently, physical unclonable functions (PUFs) attracted significant interest for numerous applications such as protection of software and hardware IP, secure key storage and component identification, to name a few. In this paper, we describe how PUFs can be used for secure key storage, component identification, IP protection in vehicle applications, and their suitability for vehicle insurance applications. Muhammad Asim 0007, Jorge Guajardo, Sandeep S. Kumar, Pim Tuyls |
VTC Spring | 3 |
| 2008 | Brand and IP protection with physical unclonable functionsabstractIn this paper we provide an overview of physical unclonable functions and explain why they are a very valuable technology to protect a company's IP and hence at the same time its brand. Physical unclonable functions are unclonable physical structures that map challenges to responses. They inherit their unclonability from the (deep sub-micron) process variations during manufacturing. They can be turned into a useful tool to generate very secure secret keys in ICs and to provide keys to protect valuable IP of fabless IC companies, IP Vendors and design houses. We will present several examples and explain cryptographic algorithms and protocols to use them in IP protection applications. Jorge Guajardo, Sandeep S. Kumar, Geert Jan Schrijen, Pim Tuyls |
ISCAS | 2 |
| 2007 | FPGA Intrinsic PUFs and Their Use for IP Protection
Jorge Guajardo, Sandeep S. Kumar, Geert Jan Schrijen, Pim Tuyls |
CHES | 2 |
| 2007 | Physical Unclonable Functions, FPGAs and Public-Key Crypto for IP ProtectionabstractIn recent years, IP protection of FPGA hardware designs has become a requirement for many IP vendors. To this end solutions have been proposed based on the idea of bitstream encryption, symmetric-key primitives, and the use of Physical Unclonable Functions (PUFs). In this paper, we propose new protocols for the IP protection problem on FPGAs based on public-key (PK) cryptography, analyze the advantages and costs of such an approach, and describe a PUF intrinsic to current FPGAs based on SRAM properties. A major advantage of using PK-based protocols is that they do not require the private key stored in the FPGA to leave the device, thus increasing security. This added security comes at the cost of additional hardware resources but it does not cause significant performance degradation. Jorge Guajardo, Sandeep S. Kumar, Geert Jan Schrijen, Pim Tuyls |
FPL | 2 |
| 2007 | A State-of-the-art Elliptic Curve Cryptographic Processor Operating in the Frequency Domain
Selçuk Baktir, Sandeep S. Kumar, Christof Paar, Berk Sunar |
Mob. Networks Appl. | 2 |
| 2006 | Breaking Ciphers with COPACOBANA - A Cost-Optimized Parallel Code BreakerabstractCryptanalysis of symmetric and asymmetric ciphers is computationally extremely demanding. Since the security parameters (in particular the key length) of almost all practical crypto algorithms are chosen such that attacks with conventional computers are computationally infeasible, the only promising way to tackle existing ciphers (assuming no mathematical breakthrough) is to build special-purpose hardware. Dedicating those machines to the task of cryptanalysis holds the promise of a dramatically improved cost-performance ratio so that breaking of commercial ciphers comes within reach. This contribution presents the design and realization of the COPACOBANA (Cost-Optimized Parallel Code Breaker) machine, which is optimized for running cryptanalytical algorithms and can be realized for less than US$ 10,000. It will be shown that, depending on the actual algorithm, the architecture can outperform conventional computers by several orders in magnitude. COPACOBANA hosts 120 low-cost FPGAs and is able to, e.g., perform an exhaustive key search of the Data Encryption Standard (DES) in less than nine days on average. As a real-world application, our architecture can be used to attack machine readable travel documents (ePass). COPACOBANA is intended, but not necessarily restricted to solving problems related to cryptanalysis. The hardware architecture is suitable for computational problems which are parallelizable and have low communication requirements. The hardware can be used, e.g., to attack elliptic curve cryptosystems and to factor numbers. Even though breaking full-size RSA (1024 bit or more) or elliptic curves (ECC with 160 bit or more) is out of reach with COPACOBANA, it can be used to analyze cryptosystems with a (deliberately chosen) small bitlength to provide reliable security estimates of RSA and ECC by extrapolation. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves. Sandeep S. Kumar, Christof Paar, Jan Pelzl, Gerd Pfeiffer, Manfred Schimmler |
CHES | 1 |
| 2006 | COPACOBANA A Cost-Optimized Special-Purpose Hardware for Code-BreakingabstractCryptanalysis of symmetric and asymmetric ciphers is computationally extremely demanding. Since the security parameters of almost all practical crypto algorithms are chosen such that attacks with conventional computers are computationally infeasible, the only promising way to tackle existing ciphers (assuming no mathematical breakthrough) is to build special-purpose hardware. This contribution presents a special-purpose hardware labeled COPACOBANA (cost-optimized parallel code breaker), which is optimized for running crypt-analytical algorithms with low communication overhead. The price-performance ratio as primary and a cost margin of less than US$ 10,000 as secondary design goal led to a reconfigurable computer built as cluster of programmable logic devices Sandeep S. Kumar, Christof Paar, Jan Pelzl, Gerd Pfeiffer, Manfred Schimmler |
FCCM | 1 |
| 2006 | Optimum Digit Serial GF(2^m) Multipliers for Curve-Based CryptographyabstractDigit serial multipliers are used extensively in hardware implementations of elliptic and hyperelliptic curve cryptography. This contribution shows different architectural enhancements in least significant digit (LSD) multiplier for binary fields GF(2m). We propose two different architectures, the double accumulator multiplier (DAM) and N-accumulator multiplier (NAM), which are both faster compared to traditional LSD multipliers. Our evaluation of the multipliers for different digit sizes gives optimum choices and shows that currently used digit sizes are the worst possible choices. Hence, one of the most important results of this contribution is that digit sizes of the form 2l- 1, where l is an integer, are preferable for the digit multipliers. Furthermore, one should always use the NAM architecture to get the best timings. Considering the time area product DAM or NAM gives the best performance depending on the digit size Sandeep S. Kumar, Thomas J. Wollinger, Christof Paar |
IEEE Trans. Computers | 1 |
| 2004 | Architectural Support for Arithmetic in Optimal Extension Fields
Johann Großschädl, Sandeep S. Kumar, Christof Paar |
ASAP | 2 |
| 2004 | Reconfigurable Instruction Set Extension for Enabling ECC on an 8-Bit Processor
Sandeep S. Kumar, Christof Paar |
FPL | 1 |
| 2003 | Efficient GF(pm) Arithmetic Architectures for Cryptographic Applications
Guido Bertoni, Jorge Guajardo, Sandeep S. Kumar, Gerardo Orlando, Christof Paar, Thomas J. Wollinger |
CT-RSA | 3 |